Base | Representation |
---|---|
bin | 101100000110110101110… |
… | …011000010101010001101 |
3 | 101201202112202000001102211 |
4 | 230012311303002222031 |
5 | 344124443003000023 |
6 | 10240231215550421 |
7 | 431661024623551 |
oct | 54066563025215 |
9 | 11652482001384 |
10 | 3031002000013 |
11 | a6949367a199 |
12 | 40b51852b411 |
13 | 18ca8c682600 |
14 | a69b644d861 |
15 | 53c9b2e6a0d |
hex | 2c1b5cc2a8d |
3031002000013 has 12 divisors (see below), whose sum is σ = 3291233303520. Its totient is φ = 2790054495696.
The previous prime is 3031001999999. The next prime is 3031002000041. The reversal of 3031002000013 is 3100002001303.
It is not a de Polignac number, because 3031002000013 - 241 = 831978744461 is a prime.
It is a Harshad number since it is a multiple of its sum of digits (13).
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 3031001999957 and 3031002000002.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (3031002000073) by changing a digit.
It is a polite number, since it can be written in 11 ways as a sum of consecutive naturals, for example, 24918331 + ... + 25039672.
It is an arithmetic number, because the mean of its divisors is an integer number (274269441960).
Almost surely, 23031002000013 is an apocalyptic number.
It is an amenable number.
3031002000013 is a deficient number, since it is larger than the sum of its proper divisors (260231303507).
3031002000013 is a wasteful number, since it uses less digits than its factorization.
3031002000013 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 49958388 (or 49958375 counting only the distinct ones).
The product of its (nonzero) digits is 54, while the sum is 13.
Adding to 3031002000013 its reverse (3100002001303), we get a palindrome (6131004001316).
The spelling of 3031002000013 in words is "three trillion, thirty-one billion, two million, thirteen", and thus it is an aban number and an uban number.
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •