Base | Representation |
---|---|
bin | 1110100100010… |
… | …1010101101111 |
3 | 11020222021101200 |
4 | 3221011111233 |
5 | 111120221143 |
6 | 10021340543 |
7 | 1341232155 |
oct | 351052557 |
9 | 136867350 |
10 | 61101423 |
11 | 31543449 |
12 | 18567753 |
13 | c8743b6 |
14 | 81873d5 |
15 | 556e1d3 |
hex | 3a4556f |
61101423 has 6 divisors (see below), whose sum is σ = 88257624. Its totient is φ = 40734276.
The previous prime is 61101419. The next prime is 61101427. The reversal of 61101423 is 32410116.
It is a happy number.
It is an interprime number because it is at equal distance from previous prime (61101419) and next prime (61101427).
It is not a de Polignac number, because 61101423 - 22 = 61101419 is a prime.
It is a super-3 number, since 3×611014233 (a number of 24 digits) contains 333 as substring.
It is a junction number, because it is equal to n+sod(n) for n = 61101396 and 61101405.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (61101427) by changing a digit.
It is a polite number, since it can be written in 5 ways as a sum of consecutive naturals, for example, 3394515 + ... + 3394532.
It is an arithmetic number, because the mean of its divisors is an integer number (14709604).
Almost surely, 261101423 is an apocalyptic number.
61101423 is a deficient number, since it is larger than the sum of its proper divisors (27156201).
61101423 is a wasteful number, since it uses less digits than its factorization.
61101423 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 6789053 (or 6789050 counting only the distinct ones).
The product of its (nonzero) digits is 144, while the sum is 18.
The square root of 61101423 is about 7816.7399214762. The cubic root of 61101423 is about 393.8677676453.
Adding to 61101423 its reverse (32410116), we get a palindrome (93511539).
The spelling of 61101423 in words is "sixty-one million, one hundred one thousand, four hundred twenty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.001 sec. • engine limits •