Base | Representation |
---|---|
bin | 10111001100010100111100… |
… | …111101010100111010110011 |
3 | 111101011022111202202212222222 |
4 | 113030110330331110322303 |
5 | 101332201001430202011 |
6 | 1000535055251151255 |
7 | 30325262426054414 |
oct | 2714247475247263 |
9 | 441138452685888 |
10 | 102002201022131 |
11 | 2a556988315513 |
12 | b5348628a552b |
13 | 44bb9c66a8c77 |
14 | 1b28d0bb2780b |
15 | bbd4a0b1bddb |
hex | 5cc53cf54eb3 |
102002201022131 has 16 divisors (see below), whose sum is σ = 106091729694720. Its totient is φ = 97990930185120.
The previous prime is 102002201022121. The next prime is 102002201022167. The reversal of 102002201022131 is 131220102200201.
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-102002201022131 is a prime.
It is a super-2 number, since 2×1020022010221312 (a number of 29 digits) contains 22 as substring.
It is not an unprimeable number, because it can be changed into a prime (102002201022121) by changing a digit.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 43132430 + ... + 45435788.
It is an arithmetic number, because the mean of its divisors is an integer number (6630733105920).
Almost surely, 2102002201022131 is an apocalyptic number.
102002201022131 is a deficient number, since it is larger than the sum of its proper divisors (4089528672589).
102002201022131 is a wasteful number, since it uses less digits than its factorization.
102002201022131 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 2320346.
The product of its (nonzero) digits is 96, while the sum is 17.
Adding to 102002201022131 its reverse (131220102200201), we get a palindrome (233222303222332).
The spelling of 102002201022131 in words is "one hundred two trillion, two billion, two hundred one million, twenty-two thousand, one hundred thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •