Base | Representation |
---|---|
bin | 10000001010111001010… |
… | …101101000111011100010 |
3 | 10221020020012120120222210 |
4 | 100022321111220323202 |
5 | 121201230010120002 |
6 | 2210252220342550 |
7 | 143165562553026 |
oct | 20127125507342 |
9 | 3836205516883 |
10 | 1111211020002 |
11 | 399297719286 |
12 | 15b43a3a4a56 |
13 | 80a2c647b15 |
14 | 3bad63c8386 |
15 | 1dd89d2496c |
hex | 102b9568ee2 |
1111211020002 has 8 divisors (see below), whose sum is σ = 2222422040016. Its totient is φ = 370403673332.
The previous prime is 1111211019959. The next prime is 1111211020009. The reversal of 1111211020002 is 2000201121111.
It is a sphenic number, since it is the product of 3 distinct primes.
1111211020002 is an admirable number.
It is a self number, because there is not a number n which added to its sum of digits gives 1111211020002.
It is not an unprimeable number, because it can be changed into a prime (1111211020009) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 92600918328 + ... + 92600918339.
It is an arithmetic number, because the mean of its divisors is an integer number (277802755002).
Almost surely, 21111211020002 is an apocalyptic number.
1111211020002 is a primitive abundant number, since it is smaller than the sum of its proper divisors, none of which is abundant.
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
1111211020002 is a wasteful number, since it uses less digits than its factorization.
1111211020002 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 185201836672.
The product of its (nonzero) digits is 8, while the sum is 12.
Adding to 1111211020002 its reverse (2000201121111), we get a palindrome (3111412141113).
The spelling of 1111211020002 in words is "one trillion, one hundred eleven billion, two hundred eleven million, twenty thousand, two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •