Base | Representation |
---|---|
bin | 10111001100010100000010… |
… | …100011001110001001100011 |
3 | 111101011012222110212200201120 |
4 | 113030110002203032021203 |
5 | 101332142000100201011 |
6 | 1000534414124103323 |
7 | 30325226226626103 |
oct | 2714240243161143 |
9 | 441135873780646 |
10 | 102001221100131 |
11 | 2a556525165621 |
12 | b53462a694b43 |
13 | 44bb89b67b872 |
14 | 1b28c57925203 |
15 | bbd444aa4a06 |
hex | 5cc5028ce263 |
102001221100131 has 64 divisors (see below), whose sum is σ = 141559284811776. Its totient is φ = 65276726860800.
The previous prime is 102001221100043. The next prime is 102001221100153. The reversal of 102001221100131 is 131001122100201.
It is not a de Polignac number, because 102001221100131 - 222 = 102001216905827 is a prime.
It is a super-2 number, since 2×1020012211001312 (a number of 29 digits) contains 22 as substring.
It is a self number, because there is not a number n which added to its sum of digits gives 102001221100131.
It is not an unprimeable number, because it can be changed into a prime (102001221100231) by changing a digit.
It is a polite number, since it can be written in 63 ways as a sum of consecutive naturals, for example, 3662902050 + ... + 3662929896.
It is an arithmetic number, because the mean of its divisors is an integer number (2211863825184).
Almost surely, 2102001221100131 is an apocalyptic number.
102001221100131 is a deficient number, since it is larger than the sum of its proper divisors (39558063711645).
102001221100131 is a wasteful number, since it uses less digits than its factorization.
102001221100131 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 29172.
The product of its (nonzero) digits is 24, while the sum is 15.
Adding to 102001221100131 its reverse (131001122100201), we get a palindrome (233002343200332).
The spelling of 102001221100131 in words is "one hundred two trillion, one billion, two hundred twenty-one million, one hundred thousand, one hundred thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •