Base | Representation |
---|---|
bin | 10001101000110111011… |
… | …100100001101000001000 |
3 | 11021212200002200202121112 |
4 | 101220313130201220020 |
5 | 124324400404031440 |
6 | 2324500333225452 |
7 | 153400145344064 |
oct | 21506734415010 |
9 | 4255602622545 |
10 | 1212111002120 |
11 | 428065074257 |
12 | 176ab9632288 |
13 | 8a3bc745a55 |
14 | 42948b9caa4 |
15 | 217e3085965 |
hex | 11a37721a08 |
1212111002120 has 32 divisors (see below), whose sum is σ = 2727331047000. Its totient is φ = 484829948928.
The previous prime is 1212111002099. The next prime is 1212111002147. The reversal of 1212111002120 is 212001112121.
It can be written as a sum of positive squares in 4 ways, for example, as 231412950916 + 980698051204 = 481054^2 + 990302^2 .
It is a junction number, because it is equal to n+sod(n) for n = 1212111002095 and 1212111002104.
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 7 ways as a sum of consecutive naturals, for example, 961706 + ... + 1830054.
Almost surely, 21212111002120 is an apocalyptic number.
1212111002120 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
It is an amenable number.
1212111002120 is an abundant number, since it is smaller than the sum of its proper divisors (1515220044880).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
1212111002120 is a wasteful number, since it uses less digits than its factorization.
1212111002120 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 903257 (or 903253 counting only the distinct ones).
The product of its (nonzero) digits is 16, while the sum is 14.
Adding to 1212111002120 its reverse (212001112121), we get a palindrome (1424112114241).
The spelling of 1212111002120 in words is "one trillion, two hundred twelve billion, one hundred eleven million, two thousand, one hundred twenty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.099 sec. • engine limits •