Base | Representation |
---|---|
bin | 101111000010000110… |
… | …0100011011100001101 |
3 | 100122201000022212211120 |
4 | 1132010030203130031 |
5 | 3123323021144323 |
6 | 114222202111153 |
7 | 10203632643564 |
oct | 1360414433415 |
9 | 318630285746 |
10 | 101002131213 |
11 | 39920085115 |
12 | 176a94ab4b9 |
13 | 96a83149a9 |
14 | 4c621a4bdb |
15 | 29621dc5e3 |
hex | 178432370d |
101002131213 has 8 divisors (see below), whose sum is σ = 135905008800. Its totient is φ = 66717003888.
The previous prime is 101002131203. The next prime is 101002131233. The reversal of 101002131213 is 312131200101.
It is a happy number.
It is a sphenic number, since it is the product of 3 distinct primes.
It is not a de Polignac number, because 101002131213 - 230 = 99928389389 is a prime.
It is a junction number, because it is equal to n+sod(n) for n = 101002131192 and 101002131201.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (101002131203) 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, 154437183 + ... + 154437836.
It is an arithmetic number, because the mean of its divisors is an integer number (16988126100).
Almost surely, 2101002131213 is an apocalyptic number.
It is an amenable number.
101002131213 is a deficient number, since it is larger than the sum of its proper divisors (34902877587).
101002131213 is a wasteful number, since it uses less digits than its factorization.
101002131213 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 308875131.
The product of its (nonzero) digits is 36, while the sum is 15.
Adding to 101002131213 its reverse (312131200101), we get a palindrome (413133331314).
The spelling of 101002131213 in words is "one hundred one billion, two million, one hundred thirty-one thousand, two hundred thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 5.092 sec. • engine limits •