Base | Representation |
---|---|
bin | 1001000110110001101001… |
… | …0111000001100000110101 |
3 | 1022110010202021001210012100 |
4 | 2101230122113001200311 |
5 | 2303014044304310401 |
6 | 33143242050412313 |
7 | 2052225652265412 |
oct | 221543227014065 |
9 | 38403667053170 |
10 | 10012011010101 |
11 | 3210085225751 |
12 | 115848a291099 |
13 | 5781896765a9 |
14 | 2688263b5109 |
15 | 12567e63ab86 |
hex | 91b1a5c1835 |
10012011010101 has 24 divisors (see below), whose sum is σ = 15078275297280. Its totient is φ = 6393768617376.
The previous prime is 10012011010097. The next prime is 10012011010123. The reversal of 10012011010101 is 10101011021001.
It is not a de Polignac number, because 10012011010101 - 22 = 10012011010097 is a prime.
It is a Harshad number since it is a multiple of its sum of digits (9).
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (10012011010171) 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 23 ways as a sum of consecutive naturals, for example, 150991245 + ... + 151057538.
It is an arithmetic number, because the mean of its divisors is an integer number (628261470720).
Almost surely, 210012011010101 is an apocalyptic number.
It is an amenable number.
10012011010101 is a deficient number, since it is larger than the sum of its proper divisors (5066264287179).
10012011010101 is a wasteful number, since it uses less digits than its factorization.
10012011010101 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 302048945 (or 302048942 counting only the distinct ones).
The product of its (nonzero) digits is 2, while the sum is 9.
Adding to 10012011010101 its reverse (10101011021001), we get a palindrome (20113022031102).
The spelling of 10012011010101 in words is "ten trillion, twelve billion, eleven million, ten thousand, one hundred one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.066 sec. • engine limits •