Base | Representation |
---|---|
bin | 10110111101111001111011… |
… | …010101111101000011100010 |
3 | 111020122120022221120121102110 |
4 | 112331321323111331003202 |
5 | 101214431223204020002 |
6 | 554455510255500150 |
7 | 30163545322203243 |
oct | 2675717325750342 |
9 | 436576287517373 |
10 | 101011110220002 |
11 | 2a204631401874 |
12 | b3b4768527656 |
13 | 44493cb11a658 |
14 | 1ad2d6ca1acca |
15 | ba27e65e7e6c |
hex | 5bde7b57d0e2 |
101011110220002 has 64 divisors (see below), whose sum is σ = 212642137588608. Its totient is φ = 31946392512000.
The previous prime is 101011110219947. The next prime is 101011110220037. The reversal of 101011110220002 is 200022011110101.
It is a self number, because there is not a number n which added to its sum of digits gives 101011110220002.
It is an unprimeable number.
It is a pernicious number, because its binary representation contains a prime number (29) of ones.
It is a polite number, since it can be written in 31 ways as a sum of consecutive naturals, for example, 16895677 + ... + 22079087.
It is an arithmetic number, because the mean of its divisors is an integer number (3322533399822).
Almost surely, 2101011110220002 is an apocalyptic number.
101011110220002 is an abundant number, since it is smaller than the sum of its proper divisors (111631027368606).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
101011110220002 is a wasteful number, since it uses less digits than its factorization.
101011110220002 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 5185635.
The product of its (nonzero) digits is 8, while the sum is 12.
Adding to 101011110220002 its reverse (200022011110101), we get a palindrome (301033121330103).
The spelling of 101011110220002 in words is "one hundred one trillion, eleven billion, one hundred ten million, two hundred twenty thousand, two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.067 sec. • engine limits •