Base | Representation |
---|---|
bin | 101111001000000000… |
… | …0001101011100111101 |
3 | 100200012211001221022212 |
4 | 1132100000031130331 |
5 | 3124224224101023 |
6 | 114253555550205 |
7 | 10211556460022 |
oct | 1362000153475 |
9 | 320184057285 |
10 | 101200222013 |
11 | 39a11983720 |
12 | 177438bb365 |
13 | 970a380c97 |
14 | 4c8060b549 |
15 | 29747bae78 |
hex | 179000d73d |
101200222013 has 8 divisors (see below), whose sum is σ = 112210082976. Its totient is φ = 90492001200.
The previous prime is 101200221943. The next prime is 101200222027. The reversal of 101200222013 is 310222002101.
It is a happy number.
It is a sphenic number, since it is the product of 3 distinct primes.
It is a cyclic number.
It is not a de Polignac number, because 101200222013 - 212 = 101200217917 is a prime.
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (101200222093) 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 7 ways as a sum of consecutive naturals, for example, 75409331 + ... + 75410672.
It is an arithmetic number, because the mean of its divisors is an integer number (14026260372).
Almost surely, 2101200222013 is an apocalyptic number.
It is an amenable number.
101200222013 is a deficient number, since it is larger than the sum of its proper divisors (11009860963).
101200222013 is a wasteful number, since it uses less digits than its factorization.
101200222013 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 150820075.
The product of its (nonzero) digits is 48, while the sum is 14.
Adding to 101200222013 its reverse (310222002101), we get a palindrome (411422224114).
The spelling of 101200222013 in words is "one hundred one billion, two hundred million, two hundred twenty-two thousand, thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.067 sec. • engine limits •