Base | Representation |
---|---|
bin | 1001000110101101111010… |
… | …1101101000000001001111 |
3 | 1022110001011112001112210111 |
4 | 2101223132231220001033 |
5 | 2303010022114131111 |
6 | 33142554502020451 |
7 | 2052162111355234 |
oct | 221533655500117 |
9 | 38401145045714 |
10 | 10011010302031 |
11 | 320a711368992 |
12 | 115824b117727 |
13 | 57805a24c03b |
14 | 26876d52178b |
15 | 125621869a21 |
hex | 91adeb6804f |
10011010302031 has 16 divisors (see below), whose sum is σ = 10707300624384. Its totient is φ = 9326730985344.
The previous prime is 10011010302019. The next prime is 10011010302079. The reversal of 10011010302031 is 13020301011001.
10011010302031 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is not a de Polignac number, because 10011010302031 - 239 = 9461254488143 is a prime.
It is a super-2 number, since 2×100110103020312 (a number of 27 digits) contains 22 as substring.
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (10011010302001) by changing a digit.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 2973030 + ... + 5372236.
It is an arithmetic number, because the mean of its divisors is an integer number (669206289024).
Almost surely, 210011010302031 is an apocalyptic number.
10011010302031 is a deficient number, since it is larger than the sum of its proper divisors (696290322353).
10011010302031 is a wasteful number, since it uses less digits than its factorization.
10011010302031 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 2401710.
The product of its (nonzero) digits is 18, while the sum is 13.
Adding to 10011010302031 its reverse (13020301011001), we get a palindrome (23031311313032).
The spelling of 10011010302031 in words is "ten trillion, eleven billion, ten million, three hundred two thousand, thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •