Base | Representation |
---|---|
bin | 10110111111101001110010… |
… | …100111111011110110011010 |
3 | 111021002001100211000012112210 |
4 | 112333221302213323312122 |
5 | 101223413221043214002 |
6 | 555031013102015550 |
7 | 30205326661163334 |
oct | 2677516247736632 |
9 | 437061324005483 |
10 | 101131223023002 |
11 | 2a250568a02507 |
12 | b413aa9b775b6 |
13 | 44578307abb53 |
14 | 1ad8ac4d28454 |
15 | ba59c643196c |
hex | 5bfa729fbd9a |
101131223023002 has 16 divisors (see below), whose sum is σ = 202265946634752. Its totient is φ = 33709824242880.
The previous prime is 101131223022931. The next prime is 101131223023067. The reversal of 101131223023002 is 200320322131101.
It is a self number, because there is not a number n which added to its sum of digits gives 101131223023002.
It is an unprimeable number.
It is a pernicious number, because its binary representation contains a prime number (31) of ones.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 145482223 + ... + 146175714.
It is an arithmetic number, because the mean of its divisors is an integer number (12641621664672).
Almost surely, 2101131223023002 is an apocalyptic number.
101131223023002 is an abundant number, since it is smaller than the sum of its proper divisors (101134723611750).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
101131223023002 is a wasteful number, since it uses less digits than its factorization.
101131223023002 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 291715733.
The product of its (nonzero) digits is 432, while the sum is 21.
Adding to 101131223023002 its reverse (200320322131101), we get a palindrome (301451545154103).
The spelling of 101131223023002 in words is "one hundred one trillion, one hundred thirty-one billion, two hundred twenty-three million, twenty-three thousand, two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.128 sec. • engine limits •