Base | Representation |
---|---|
bin | 1000001101111101… |
… | …11001110000100101 |
3 | 102101111011220221121 |
4 | 10012332321300211 |
5 | 33014000320401 |
6 | 2005451013541 |
7 | 214223254624 |
oct | 40676716045 |
9 | 12344156847 |
10 | 4412120101 |
11 | 1964588154 |
12 | a3173a2b1 |
13 | 55411786c |
14 | 2dbd916bb |
15 | 1ac52eca1 |
hex | 106fb9c25 |
4412120101 has 2 divisors, whose sum is σ = 4412120102. Its totient is φ = 4412120100.
The previous prime is 4412120099. The next prime is 4412120129. The reversal of 4412120101 is 1010212144.
It is a happy number.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 4000436001 + 411684100 = 63249^2 + 20290^2 .
It is a cyclic number.
It is not a de Polignac number, because 4412120101 - 21 = 4412120099 is a prime.
Together with 4412120099, it forms a pair of twin primes.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (4412120161) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (17) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 2206060050 + 2206060051.
It is an arithmetic number, because the mean of its divisors is an integer number (2206060051).
Almost surely, 24412120101 is an apocalyptic number.
It is an amenable number.
4412120101 is a deficient number, since it is larger than the sum of its proper divisors (1).
4412120101 is an equidigital number, since it uses as much as digits as its factorization.
4412120101 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 64, while the sum is 16.
The square root of 4412120101 is about 66423.7916788857. The cubic root of 4412120101 is about 1640.1457461440.
Adding to 4412120101 its reverse (1010212144), we get a palindrome (5422332245).
The spelling of 4412120101 in words is "four billion, four hundred twelve million, one hundred twenty thousand, one hundred one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.082 sec. • engine limits •