Base | Representation |
---|---|
bin | 1001001100100110111101… |
… | …0101110101110100000001 |
3 | 1022210201102001212021210120 |
4 | 2103021233111311310001 |
5 | 2311134312034324301 |
6 | 33301253514450453 |
7 | 2062404156244131 |
oct | 223115725656401 |
9 | 38721361767716 |
10 | 10112221011201 |
11 | 3249629154781 |
12 | 1173996433a29 |
13 | 58476983252a |
14 | 26d61129cac1 |
15 | 128097007e36 |
hex | 9326f575d01 |
10112221011201 has 8 divisors (see below), whose sum is σ = 13847365709184. Its totient is φ = 6559278493680.
The previous prime is 10112221011187. The next prime is 10112221011223. The reversal of 10112221011201 is 10211012221101.
It is a happy number.
10112221011201 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is a sphenic number, since it is the product of 3 distinct primes.
It is not a de Polignac number, because 10112221011201 - 219 = 10112220486913 is a prime.
It is not an unprimeable number, because it can be changed into a prime (10112221031201) 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, 45550544985 + ... + 45550545206.
It is an arithmetic number, because the mean of its divisors is an integer number (1730920713648).
Almost surely, 210112221011201 is an apocalyptic number.
It is an amenable number.
10112221011201 is a deficient number, since it is larger than the sum of its proper divisors (3735144697983).
10112221011201 is an equidigital number, since it uses as much as digits as its factorization.
10112221011201 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 91101090231.
The product of its (nonzero) digits is 16, while the sum is 15.
Adding to 10112221011201 its reverse (10211012221101), we get a palindrome (20323233232302).
The spelling of 10112221011201 in words is "ten trillion, one hundred twelve billion, two hundred twenty-one million, eleven thousand, two hundred one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.065 sec. • engine limits •