Base | Representation |
---|---|
bin | 1001000110000100111001… |
… | …1100101010000110000111 |
3 | 1022101222202012020021100212 |
4 | 2101201032130222012013 |
5 | 2302320000000003031 |
6 | 33133534145030035 |
7 | 2051322215345402 |
oct | 221411634520607 |
9 | 38358665207325 |
10 | 10000000000391 |
11 | 3205a81334345 |
12 | 115609792531b |
13 | 576cc415875b |
14 | 26800712cd39 |
15 | 1251c9e4312b |
hex | 9184e72a187 |
10000000000391 has 2 divisors, whose sum is σ = 10000000000392. Its totient is φ = 10000000000390.
The previous prime is 10000000000343. The next prime is 10000000000411. The reversal of 10000000000391 is 19300000000001.
It is a strong prime.
It is a cyclic number.
It is not a de Polignac number, because 10000000000391 - 242 = 5601953489287 is a prime.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (10000000000591) 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 as a sum of consecutive naturals, namely, 5000000000195 + 5000000000196.
It is an arithmetic number, because the mean of its divisors is an integer number (5000000000196).
Almost surely, 210000000000391 is an apocalyptic number.
10000000000391 is a deficient number, since it is larger than the sum of its proper divisors (1).
10000000000391 is an equidigital number, since it uses as much as digits as its factorization.
10000000000391 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 27, while the sum is 14.
Adding to 10000000000391 its reverse (19300000000001), we get a palindrome (29300000000392).
The spelling of 10000000000391 in words is "ten trillion, three hundred ninety-one", and thus it is an aban number.
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •