Base | Representation |
---|---|
bin | 1001000110101101111101… |
… | …0110110100010010101001 |
3 | 1022110001012021101011002201 |
4 | 2101223133112310102221 |
5 | 2303010032400201301 |
6 | 33142555525300201 |
7 | 2052162302220622 |
oct | 221533726642251 |
9 | 38401167334081 |
10 | 10011021100201 |
11 | 320a7174737a0 |
12 | 1158252864661 |
13 | 57805c55cca4 |
14 | 268770b32a49 |
15 | 12562279e201 |
hex | 91adf5b44a9 |
10011021100201 has 16 divisors (see below), whose sum is σ = 11496019541760. Its totient is φ = 8621849440080.
The previous prime is 10011021100177. The next prime is 10011021100217. The reversal of 10011021100201 is 10200112011001.
It is a cyclic number.
It is not a de Polignac number, because 10011021100201 - 221 = 10011019003049 is a prime.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (10011021100501) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (23) of ones.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 33396750 + ... + 33695176.
It is an arithmetic number, because the mean of its divisors is an integer number (718501221360).
Almost surely, 210011021100201 is an apocalyptic number.
10011021100201 is a gapful number since it is divisible by the number (11) formed by its first and last digit.
It is an amenable number.
10011021100201 is a deficient number, since it is larger than the sum of its proper divisors (1484998441559).
10011021100201 is a wasteful number, since it uses less digits than its factorization.
10011021100201 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 458964.
The product of its (nonzero) digits is 4, while the sum is 10.
Adding to 10011021100201 its reverse (10200112011001), we get a palindrome (20211133111202).
The spelling of 10011021100201 in words is "ten trillion, eleven billion, twenty-one million, one hundred thousand, two hundred one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •