Base | Representation |
---|---|
bin | 10111001110000010110110… |
… | …111110010100110100100101 |
3 | 111101120121010011122221112110 |
4 | 113032002312332110310211 |
5 | 101341114143312034341 |
6 | 1001105213340511233 |
7 | 30336641025520425 |
oct | 2716026676246445 |
9 | 441517104587473 |
10 | 102120212221221 |
11 | 2a5a1a36592017 |
12 | b5536b854b519 |
13 | 44c9b8283a55c |
14 | 1b30904c8c485 |
15 | bc15ab1c3216 |
hex | 5ce0b6f94d25 |
102120212221221 has 8 divisors (see below), whose sum is σ = 136168237711584. Its totient is φ = 68076164105840.
The previous prime is 102120212221189. The next prime is 102120212221249. The reversal of 102120212221221 is 122122212021201.
It is a sphenic number, since it is the product of 3 distinct primes.
It is a cyclic number.
It is not a de Polignac number, because 102120212221221 - 25 = 102120212221189 is a prime.
It is a Curzon number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (102120212221421) 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, 994283835 + ... + 994386536.
It is an arithmetic number, because the mean of its divisors is an integer number (17021029713948).
Almost surely, 2102120212221221 is an apocalyptic number.
It is an amenable number.
102120212221221 is a deficient number, since it is larger than the sum of its proper divisors (34048025490363).
102120212221221 is a wasteful number, since it uses less digits than its factorization.
102120212221221 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1988687491.
The product of its (nonzero) digits is 256, while the sum is 21.
Adding to 102120212221221 its reverse (122122212021201), we get a palindrome (224242424242422).
The spelling of 102120212221221 in words is "one hundred two trillion, one hundred twenty billion, two hundred twelve million, two hundred twenty-one thousand, two hundred twenty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •