Base | Representation |
---|---|
bin | 1001001101001000011010… |
… | …1010011001110101101001 |
3 | 1022211120120222120120102122 |
4 | 2103102012222121311221 |
5 | 2311311210231242301 |
6 | 33305341025041025 |
7 | 2063142553220453 |
oct | 223220652316551 |
9 | 38746528516378 |
10 | 10121202212201 |
11 | 3252417875a43 |
12 | 1175682186175 |
13 | 58556b42cc52 |
14 | 26dc23dbd2d3 |
15 | 12842071e81b |
hex | 93486a99d69 |
10121202212201 has 8 divisors (see below), whose sum is σ = 10287749899008. Its totient is φ = 9954674730000.
The previous prime is 10121202212189. The next prime is 10121202212227. The reversal of 10121202212201 is 10221220212101.
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 10121202212201 - 26 = 10121202212137 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 10121202212201.
It is not an unprimeable number, because it can be changed into a prime (10121202212701) 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, 4039385 + ... + 6046406.
It is an arithmetic number, because the mean of its divisors is an integer number (1285968737376).
Almost surely, 210121202212201 is an apocalyptic number.
It is an amenable number.
10121202212201 is a deficient number, since it is larger than the sum of its proper divisors (166547686807).
10121202212201 is a wasteful number, since it uses less digits than its factorization.
10121202212201 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 10102303.
The product of its (nonzero) digits is 64, while the sum is 17.
Adding to 10121202212201 its reverse (10221220212101), we get a palindrome (20342422424302).
The spelling of 10121202212201 in words is "ten trillion, one hundred twenty-one billion, two hundred two million, two hundred twelve thousand, two hundred one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.082 sec. • engine limits •