Base | Representation |
---|---|
bin | 100100000100100… |
… | …0000110001011101 |
3 | 10010100102201200020 |
4 | 1020021000301131 |
5 | 4434320301023 |
6 | 320033222353 |
7 | 41664365415 |
oct | 11011006135 |
9 | 3110381606 |
10 | 1210322013 |
11 | 57121692a |
12 | 2994019b9 |
13 | 163999794 |
14 | b6a59645 |
15 | 713c8de3 |
hex | 48240c5d |
1210322013 has 8 divisors (see below), whose sum is σ = 1623091488. Its totient is φ = 802216944.
The previous prime is 1210321991. The next prime is 1210322027. The reversal of 1210322013 is 3102230121.
It is a sphenic number, since it is the product of 3 distinct primes.
It is not a de Polignac number, because 1210322013 - 216 = 1210256477 is a prime.
It is a Curzon number.
It is a junction number, because it is equal to n+sod(n) for n = 1210321983 and 1210322001.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (1210322053) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (11) of ones.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 1165495 + ... + 1166532.
It is an arithmetic number, because the mean of its divisors is an integer number (202886436).
Almost surely, 21210322013 is an apocalyptic number.
It is an amenable number.
1210322013 is a deficient number, since it is larger than the sum of its proper divisors (412769475).
1210322013 is a wasteful number, since it uses less digits than its factorization.
1210322013 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 2332203.
The product of its (nonzero) digits is 72, while the sum is 15.
The square root of 1210322013 is about 34789.6825653814. The cubic root of 1210322013 is about 1065.6967566945.
Adding to 1210322013 its reverse (3102230121), we get a palindrome (4312552134).
The spelling of 1210322013 in words is "one billion, two hundred ten million, three hundred twenty-two thousand, thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •