Base | Representation |
---|---|
bin | 1011110100101101111001… |
… | …1000100001111010101111 |
3 | 1201000211001101210020011012 |
4 | 2331023132120201322233 |
5 | 3200444104303310111 |
6 | 43352131205415435 |
7 | 2511145413552200 |
oct | 275133630417257 |
9 | 51024041706135 |
10 | 13000302010031 |
11 | 4162440627366 |
12 | 155b666a0a57b |
13 | 733c0040b08b |
14 | 32d30a19d5a7 |
15 | 17827ae4148b |
hex | bd2de621eaf |
13000302010031 has 6 divisors (see below), whose sum is σ = 15122800297440. Its totient is φ = 11143116008556.
The previous prime is 13000302010027. The next prime is 13000302010051. The reversal of 13000302010031 is 13001020300031.
It is not a de Polignac number, because 13000302010031 - 22 = 13000302010027 is a prime.
It is a super-2 number, since 2×130003020100312 (a number of 27 digits) contains 22 as substring.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 13000302009988 and 13000302010015.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (13000302010051) by changing a digit.
It is a polite number, since it can be written in 5 ways as a sum of consecutive naturals, for example, 132656142911 + ... + 132656143008.
It is an arithmetic number, because the mean of its divisors is an integer number (2520466716240).
Almost surely, 213000302010031 is an apocalyptic number.
13000302010031 is a deficient number, since it is larger than the sum of its proper divisors (2122498287409).
13000302010031 is an equidigital number, since it uses as much as digits as its factorization.
13000302010031 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 265312285933 (or 265312285926 counting only the distinct ones).
The product of its (nonzero) digits is 54, while the sum is 14.
Adding to 13000302010031 its reverse (13001020300031), we get a palindrome (26001322310062).
The spelling of 13000302010031 in words is "thirteen trillion, three hundred two million, ten thousand, thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.083 sec. • engine limits •