Base | Representation |
---|---|
bin | 10111001100100101101001… |
… | …110011001100110010111001 |
3 | 111101020000210111100111002011 |
4 | 113030211221303030302321 |
5 | 101332444213100230241 |
6 | 1000551222512205521 |
7 | 30326466002131363 |
oct | 2714455163146271 |
9 | 441200714314064 |
10 | 102020133211321 |
11 | 2a56354a5a1686 |
12 | b5382282398a1 |
13 | 44c05c38562c0 |
14 | 1b29b2d541d33 |
15 | bbdba007d281 |
hex | 5cc969ccccb9 |
102020133211321 has 8 divisors (see below), whose sum is σ = 110934513784640. Its totient is φ = 93258135212112.
The previous prime is 102020133211309. The next prime is 102020133211349. The reversal of 102020133211321 is 123112331020201.
It is a sphenic number, since it is the product of 3 distinct primes.
It is not a de Polignac number, because 102020133211321 - 27 = 102020133211193 is a prime.
It is a junction number, because it is equal to n+sod(n) for n = 102020133211292 and 102020133211301.
It is not an unprimeable number, because it can be changed into a prime (102020133211361) by changing a digit.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 38095642131 + ... + 38095644808.
It is an arithmetic number, because the mean of its divisors is an integer number (13866814223080).
Almost surely, 2102020133211321 is an apocalyptic number.
It is an amenable number.
102020133211321 is a deficient number, since it is larger than the sum of its proper divisors (8914380573319).
102020133211321 is a wasteful number, since it uses less digits than its factorization.
102020133211321 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 76191287055.
The product of its (nonzero) digits is 432, while the sum is 22.
Adding to 102020133211321 its reverse (123112331020201), we get a palindrome (225132464231522).
The spelling of 102020133211321 in words is "one hundred two trillion, twenty billion, one hundred thirty-three million, two hundred eleven thousand, three hundred twenty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.066 sec. • engine limits •