Base | Representation |
---|---|
bin | 1011110100110100100110… |
… | …0011010100010100011111 |
3 | 1201000222200201000120202102 |
4 | 2331031021203110110133 |
5 | 3201011300100000111 |
6 | 43353025434515315 |
7 | 2511241105325432 |
oct | 275151143242437 |
9 | 51028621016672 |
10 | 13002100000031 |
11 | 416318353890a |
12 | 155ba88b95b3b |
13 | 734128a7629c |
14 | 32d43acb1819 |
15 | 178333bee13b |
hex | bd3498d451f |
13002100000031 has 2 divisors, whose sum is σ = 13002100000032. Its totient is φ = 13002100000030.
The previous prime is 13002099999991. The next prime is 13002100000079. The reversal of 13002100000031 is 13000000120031.
It is a weak prime.
It is a cyclic number.
It is not a de Polignac number, because 13002100000031 - 214 = 13002099983647 is a prime.
It is a super-2 number, since 2×130021000000312 (a number of 27 digits) contains 22 as substring.
It is a junction number, because it is equal to n+sod(n) for n = 13002099999958 and 13002100000021.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (13002100000231) 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 as a sum of consecutive naturals, namely, 6501050000015 + 6501050000016.
It is an arithmetic number, because the mean of its divisors is an integer number (6501050000016).
Almost surely, 213002100000031 is an apocalyptic number.
13002100000031 is a deficient number, since it is larger than the sum of its proper divisors (1).
13002100000031 is an equidigital number, since it uses as much as digits as its factorization.
13002100000031 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 18, while the sum is 11.
Adding to 13002100000031 its reverse (13000000120031), we get a palindrome (26002100120062).
The spelling of 13002100000031 in words is "thirteen trillion, two billion, one hundred million, thirty-one", and thus it is an aban number.
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.178 sec. • engine limits •