Base | Representation |
---|---|
bin | 1001000111010111010001… |
… | …1100000011010011101001 |
3 | 1022111002211020021000111122 |
4 | 2101311310130003103221 |
5 | 2303200241211242301 |
6 | 33152032250305025 |
7 | 2053034166140255 |
oct | 221656434032351 |
9 | 38432736230448 |
10 | 10022112212201 |
11 | 3214399082361 |
12 | 115a429128175 |
13 | 57910930875b |
14 | 269103b5d265 |
15 | 125a7133981b |
hex | 91d747034e9 |
10022112212201 has 8 divisors (see below), whose sum is σ = 10166203787904. Its totient is φ = 9878102166240.
The previous prime is 10022112212197. The next prime is 10022112212213. The reversal of 10022112212201 is 10221221122001.
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 10022112212201 - 22 = 10022112212197 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 10022112212201.
It is not an unprimeable number, because it can be changed into a prime (10022112214201) 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, 20134796 + ... + 20626541.
It is an arithmetic number, because the mean of its divisors is an integer number (1270775473488).
Almost surely, 210022112212201 is an apocalyptic number.
It is an amenable number.
10022112212201 is a deficient number, since it is larger than the sum of its proper divisors (144091575703).
10022112212201 is an equidigital number, since it uses as much as digits as its factorization.
10022112212201 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 40764871.
The product of its (nonzero) digits is 64, while the sum is 17.
Adding to 10022112212201 its reverse (10221221122001), we get a palindrome (20243333334202).
The spelling of 10022112212201 in words is "ten trillion, twenty-two billion, one hundred twelve million, two hundred twelve thousand, two hundred one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •