Base | Representation |
---|---|
bin | 100100000111101… |
… | …1010111011011010 |
3 | 10010110121002012100 |
4 | 1020033122323122 |
5 | 4440233031020 |
6 | 320133224230 |
7 | 42014563362 |
oct | 11017327332 |
9 | 3113532170 |
10 | 1212002010 |
11 | 57216405a |
12 | 299a92076 |
13 | 16413736b |
14 | b6d759a2 |
15 | 7160ba90 |
hex | 483daeda |
1212002010 has 48 divisors (see below), whose sum is σ = 3174239016. Its totient is φ = 320838144.
The previous prime is 1212002003. The next prime is 1212002023. The reversal of 1212002010 is 102002121.
It can be written as a sum of positive squares in 4 ways, for example, as 776904129 + 435097881 = 27873^2 + 20859^2 .
It is a Harshad number since it is a multiple of its sum of digits (9).
It is a junction number, because it is equal to n+sod(n) for n = 1212001983 and 1212002001.
It is an unprimeable number.
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 in 23 ways as a sum of consecutive naturals, for example, 36819 + ... + 61478.
Almost surely, 21212002010 is an apocalyptic number.
1212002010 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
1212002010 is an abundant number, since it is smaller than the sum of its proper divisors (1962237006).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
1212002010 is a wasteful number, since it uses less digits than its factorization.
1212002010 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 98447 (or 98444 counting only the distinct ones).
The product of its (nonzero) digits is 8, while the sum is 9.
The square root of 1212002010 is about 34813.8192389172. The cubic root of 1212002010 is about 1066.1896116525.
Adding to 1212002010 its reverse (102002121), we get a palindrome (1314004131).
The spelling of 1212002010 in words is "one billion, two hundred twelve million, two thousand, ten".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.076 sec. • engine limits •