Base | Representation |
---|---|
bin | 1001001100100110111010… |
… | …1100010000101011100001 |
3 | 1022210201101022100111210212 |
4 | 2103021232230100223201 |
5 | 2311134301242024301 |
6 | 33301252445103505 |
7 | 2062403664505532 |
oct | 223115654205341 |
9 | 38721338314725 |
10 | 10112210111201 |
11 | 3249622a8a410 |
12 | 1173992857b95 |
13 | 5847674b7123 |
14 | 26d60da62689 |
15 | 1280960a34bb |
hex | 9326eb10ae1 |
10112210111201 has 8 divisors (see below), whose sum is σ = 11118364161024. Its totient is φ = 9120533098320.
The previous prime is 10112210111197. The next prime is 10112210111203. The reversal of 10112210111201 is 10211101221101.
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 10112210111201 - 22 = 10112210111197 is a prime.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (10112210111203) 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, 3619257770 + ... + 3619260563.
It is an arithmetic number, because the mean of its divisors is an integer number (1389795520128).
Almost surely, 210112210111201 is an apocalyptic number.
10112210111201 is a gapful number since it is divisible by the number (11) formed by its first and last digit.
It is an amenable number.
10112210111201 is a deficient number, since it is larger than the sum of its proper divisors (1006154049823).
10112210111201 is a wasteful number, since it uses less digits than its factorization.
10112210111201 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 7238518471.
The product of its (nonzero) digits is 8, while the sum is 14.
Adding to 10112210111201 its reverse (10211101221101), we get a palindrome (20323311332302).
The spelling of 10112210111201 in words is "ten trillion, one hundred twelve billion, two hundred ten million, one hundred eleven thousand, two hundred one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.079 sec. • engine limits •