Base | Representation |
---|---|
bin | 11101011011010101110… |
… | …10011100100111001010 |
3 | 10120122212001202202220102 |
4 | 32231222322130213022 |
5 | 113031223410133002 |
6 | 2052255322125402 |
7 | 133023162605165 |
oct | 16555272344712 |
9 | 3518761682812 |
10 | 1011111021002 |
11 | 35a89a8a2485 |
12 | 143b63050862 |
13 | 744691c5194 |
14 | 36d1bd76adc |
15 | 1b47be35a02 |
hex | eb6ae9c9ca |
1011111021002 has 64 divisors (see below), whose sum is σ = 1577544958080. Its totient is φ = 485781214464.
The previous prime is 1011111020993. The next prime is 1011111021017. The reversal of 1011111021002 is 2001201111101.
It is an unprimeable number.
It is a pernicious number, because its binary representation contains a prime number (23) of ones.
It is a polite number, since it can be written in 31 ways as a sum of consecutive naturals, for example, 1145085653 + ... + 1145086535.
It is an arithmetic number, because the mean of its divisors is an integer number (24649139970).
Almost surely, 21011111021002 is an apocalyptic number.
1011111021002 is a deficient number, since it is larger than the sum of its proper divisors (566433937078).
1011111021002 is a wasteful number, since it uses less digits than its factorization.
1011111021002 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 2007.
The product of its (nonzero) digits is 4, while the sum is 11.
Adding to 1011111021002 its reverse (2001201111101), we get a palindrome (3012312132103).
Subtracting 1011111021002 from its reverse (2001201111101), we obtain a palindrome (990090090099).
The spelling of 1011111021002 in words is "one trillion, eleven billion, one hundred eleven million, twenty-one thousand, two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.065 sec. • engine limits •