Base | Representation |
---|---|
bin | 1001000110000110001000… |
… | …1011011100010111001101 |
3 | 1022102000121021010102101022 |
4 | 2101201202023130113031 |
5 | 2302321134221011023 |
6 | 33134031052123525 |
7 | 2051333345151230 |
oct | 221414213342715 |
9 | 38360537112338 |
10 | 10000331032013 |
11 | 32061311832a3 |
12 | 115616a7665a5 |
13 | 5770478ccc5a |
14 | 26803909d417 |
15 | 1251e90317c8 |
hex | 918622dc5cd |
10000331032013 has 16 divisors (see below), whose sum is σ = 12212261487360. Its totient is φ = 7993480225536.
The previous prime is 10000331031991. The next prime is 10000331032019. The reversal of 10000331032013 is 31023013300001.
It is a cyclic number.
It is not a de Polignac number, because 10000331032013 - 216 = 10000330966477 is a prime.
It is a Harshad number since it is a multiple of its sum of digits (17).
It is a Duffinian number.
It is a Curzon number.
It is a junction number, because it is equal to n+sod(n) for n = 10000331031982 and 10000331032000.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (10000331032019) 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, 385475081 + ... + 385501022.
It is an arithmetic number, because the mean of its divisors is an integer number (763266342960).
Almost surely, 210000331032013 is an apocalyptic number.
It is an amenable number.
10000331032013 is a deficient number, since it is larger than the sum of its proper divisors (2211930455347).
10000331032013 is a wasteful number, since it uses less digits than its factorization.
10000331032013 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 770976236.
The product of its (nonzero) digits is 162, while the sum is 17.
Adding to 10000331032013 its reverse (31023013300001), we get a palindrome (41023344332014).
The spelling of 10000331032013 in words is "ten trillion, three hundred thirty-one million, thirty-two thousand, thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.074 sec. • engine limits •