Base | Representation |
---|---|
bin | 1001001100100110001001… |
… | …0010110011011000011001 |
3 | 1022210200211210222000011202 |
4 | 2103021202102303120121 |
5 | 2311133340020023001 |
6 | 33301220055003545 |
7 | 2062365560521130 |
oct | 223114222633031 |
9 | 38720753860152 |
10 | 10112002111001 |
11 | 324952663281a |
12 | 11739350695b5 |
13 | 58473338b59b |
14 | 26d5d019a917 |
15 | 128082bb896b |
hex | 932624b3619 |
10112002111001 has 8 divisors (see below), whose sum is σ = 11562127233024. Its totient is φ = 8663265336960.
The previous prime is 10112002110941. The next prime is 10112002111067. The reversal of 10112002111001 is 10011120021101.
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 10112002111001 - 230 = 10110928369177 is a prime.
It is a Duffinian number.
It is a Curzon number.
It is not an unprimeable number, because it can be changed into a prime (10112002111201) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 347071385 + ... + 347100518.
It is an arithmetic number, because the mean of its divisors is an integer number (1445265904128).
Almost surely, 210112002111001 is an apocalyptic number.
It is an amenable number.
10112002111001 is a deficient number, since it is larger than the sum of its proper divisors (1450125122023).
10112002111001 is an equidigital number, since it uses as much as digits as its factorization.
10112002111001 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 694173991.
The product of its (nonzero) digits is 4, while the sum is 11.
Adding to 10112002111001 its reverse (10011120021101), we get a palindrome (20123122132102).
The spelling of 10112002111001 in words is "ten trillion, one hundred twelve billion, two million, one hundred eleven thousand, one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •