Base | Representation |
---|---|
bin | 101111001000100110… |
… | …0000010101110010101 |
3 | 100200021012110220012010 |
4 | 1132101030002232111 |
5 | 3124244321213023 |
6 | 114255550014433 |
7 | 10212220443213 |
oct | 1362114025625 |
9 | 320235426163 |
10 | 101220101013 |
11 | 39a22121049 |
12 | 1774a4a7419 |
13 | 97115212c5 |
14 | 4c83103cb3 |
15 | 29763e6093 |
hex | 1791302b95 |
101220101013 has 32 divisors (see below), whose sum is σ = 144462528000. Its totient is φ = 62819326976.
The previous prime is 101220101009. The next prime is 101220101053. The reversal of 101220101013 is 310101022101.
It is not a de Polignac number, because 101220101013 - 22 = 101220101009 is a prime.
It is a self number, because there is not a number n which added to its sum of digits gives 101220101013.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (101220101053) by changing a digit.
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 31 ways as a sum of consecutive naturals, for example, 1788295 + ... + 1844027.
It is an arithmetic number, because the mean of its divisors is an integer number (4514454000).
Almost surely, 2101220101013 is an apocalyptic number.
It is an amenable number.
101220101013 is a deficient number, since it is larger than the sum of its proper divisors (43242426987).
101220101013 is a wasteful number, since it uses less digits than its factorization.
101220101013 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 56141.
The product of its (nonzero) digits is 12, while the sum is 12.
Adding to 101220101013 its reverse (310101022101), we get a palindrome (411321123114).
The spelling of 101220101013 in words is "one hundred one billion, two hundred twenty million, one hundred one thousand, thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.064 sec. • engine limits •