Base | Representation |
---|---|
bin | 1001001100000000111101… |
… | …1011101111010101101101 |
3 | 1022202202002021122100122112 |
4 | 2103000033123233111231 |
5 | 2311002420113311341 |
6 | 33252445502453405 |
7 | 2061563344205321 |
oct | 223001733572555 |
9 | 38682067570575 |
10 | 10102022010221 |
11 | 324527507a349 |
12 | 1171a0a894265 |
13 | 58380284a6cb |
14 | 26cd24937981 |
15 | 127b9b93baeb |
hex | 9300f6ef56d |
10102022010221 has 8 divisors (see below), whose sum is σ = 10636294108800. Its totient is φ = 9568008584640.
The previous prime is 10102022010193. The next prime is 10102022010247. The reversal of 10102022010221 is 12201022020101.
It is a sphenic number, since it is the product of 3 distinct primes.
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-10102022010221 is a prime.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 10102022010196 and 10102022010205.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (10102022000221) 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, 64588076 + ... + 64744293.
It is an arithmetic number, because the mean of its divisors is an integer number (1329536763600).
Almost surely, 210102022010221 is an apocalyptic number.
It is an amenable number.
10102022010221 is a deficient number, since it is larger than the sum of its proper divisors (534272098579).
10102022010221 is a wasteful number, since it uses less digits than its factorization.
10102022010221 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 129336499.
The product of its (nonzero) digits is 32, while the sum is 14.
Adding to 10102022010221 its reverse (12201022020101), we get a palindrome (22303044030322).
The spelling of 10102022010221 in words is "ten trillion, one hundred two billion, twenty-two million, ten thousand, two hundred twenty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •