Base | Representation |
---|---|
bin | 10111001111010110011111… |
… | …011010010100110010000001 |
3 | 111101220011220102022210100122 |
4 | 113033112133122110302001 |
5 | 101344102100333033441 |
6 | 1001214344141030025 |
7 | 30346300234443026 |
oct | 2717263732246201 |
9 | 441804812283318 |
10 | 102210011221121 |
11 | 2a6270277a7821 |
12 | b568b99b55315 |
13 | 4505493b1525b |
14 | 1b34dc31c754d |
15 | bc3ab4a9934b |
hex | 5cf59f694c81 |
102210011221121 has 16 divisors (see below), whose sum is σ = 105268705280640. Its totient is φ = 99198068012160.
The previous prime is 102210011221081. The next prime is 102210011221127. The reversal of 102210011221121 is 121122110012201.
It is a cyclic number.
It is not a de Polignac number, because 102210011221121 - 214 = 102210011204737 is a prime.
It is a Duffinian number.
It is a self number, because there is not a number n which added to its sum of digits gives 102210011221121.
It is not an unprimeable number, because it can be changed into a prime (102210011221127) 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, 21343301 + ... + 25689618.
It is an arithmetic number, because the mean of its divisors is an integer number (6579294080040).
Almost surely, 2102210011221121 is an apocalyptic number.
It is an amenable number.
102210011221121 is a deficient number, since it is larger than the sum of its proper divisors (3058694059519).
102210011221121 is a wasteful number, since it uses less digits than its factorization.
102210011221121 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 47033416.
The product of its (nonzero) digits is 32, while the sum is 17.
Adding to 102210011221121 its reverse (121122110012201), we get a palindrome (223332121233322).
The spelling of 102210011221121 in words is "one hundred two trillion, two hundred ten billion, eleven million, two hundred twenty-one thousand, one hundred twenty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •