Base | Representation |
---|---|
bin | 10110111101110001101110… |
… | …110101000000110000001100 |
3 | 111020121201121200000112102010 |
4 | 112331301232311000300030 |
5 | 101214310212420320322 |
6 | 554451453143301220 |
7 | 30163114256256414 |
oct | 2675615665006014 |
9 | 436551550015363 |
10 | 101002310323212 |
11 | 2a2009260640a1 |
12 | b3b2b1144a810 |
13 | 4448627c5c62c |
14 | 1ad2776013644 |
15 | ba247dc9620c |
hex | 5bdc6ed40c0c |
101002310323212 has 12 divisors (see below), whose sum is σ = 235672057420856. Its totient is φ = 33667436774400.
The previous prime is 101002310323153. The next prime is 101002310323231. The reversal of 101002310323212 is 212323013200101.
It is a tau number, because it is divible by the number of its divisors (12).
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 3 ways as a sum of consecutive naturals, for example, 4208429596789 + ... + 4208429596812.
Almost surely, 2101002310323212 is an apocalyptic number.
101002310323212 is a gapful number since it is divisible by the number (12) formed by its first and last digit.
It is an amenable number.
101002310323212 is an abundant number, since it is smaller than the sum of its proper divisors (134669747097644).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
101002310323212 is a wasteful number, since it uses less digits than its factorization.
101002310323212 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 8416859193608 (or 8416859193606 counting only the distinct ones).
The product of its (nonzero) digits is 432, while the sum is 21.
Adding to 101002310323212 its reverse (212323013200101), we get a palindrome (313325323523313).
The spelling of 101002310323212 in words is "one hundred one trillion, two billion, three hundred ten million, three hundred twenty-three thousand, two hundred twelve".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •