Base | Representation |
---|---|
bin | 1001000110110010000001… |
… | …0000101011101001111001 |
3 | 1022110011000011100112220100 |
4 | 2101230200100223221321 |
5 | 2303014300130323001 |
6 | 33143255544350013 |
7 | 2052231263626650 |
oct | 221544020535171 |
9 | 38404004315810 |
10 | 10012110011001 |
11 | 32101260a457a |
12 | 11584b7475309 |
13 | 5781a402a3c7 |
14 | 2688355c6197 |
15 | 125688194586 |
hex | 91b2042ba79 |
10012110011001 has 12 divisors (see below), whose sum is σ = 16527927637312. Its totient is φ = 5721205720536.
The previous prime is 10012110010993. The next prime is 10012110011003. The reversal of 10012110011001 is 10011001121001.
It is not a de Polignac number, because 10012110011001 - 23 = 10012110010993 is a prime.
It is a Harshad number since it is a multiple of its sum of digits (9).
It is a Curzon number.
It is not an unprimeable number, because it can be changed into a prime (10012110011003) 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 11 ways as a sum of consecutive naturals, for example, 79461190501 + ... + 79461190626.
Almost surely, 210012110011001 is an apocalyptic number.
It is an amenable number.
10012110011001 is a deficient number, since it is larger than the sum of its proper divisors (6515817626311).
10012110011001 is a wasteful number, since it uses less digits than its factorization.
10012110011001 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 158922381140 (or 158922381137 counting only the distinct ones).
The product of its (nonzero) digits is 2, while the sum is 9.
Adding to 10012110011001 its reverse (10011001121001), we get a palindrome (20023111132002).
Subtracting from 10012110011001 its reverse (10011001121001), we obtain a square (1108890000 = 333002).
The spelling of 10012110011001 in words is "ten trillion, twelve billion, one hundred ten million, eleven thousand, one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.094 sec. • engine limits •