Base | Representation |
---|---|
bin | 11100110111110000… |
… | …110001000110111101 |
3 | 2222000110112111202211 |
4 | 130313300301012331 |
5 | 1001442034131023 |
6 | 22124044020421 |
7 | 2145134135152 |
oct | 346760610675 |
9 | 88013474684 |
10 | 31000302013 |
11 | 1216895380a |
12 | 6011b31711 |
13 | 2c006a9895 |
14 | 1701234229 |
15 | c16869a0d |
hex | 737c311bd |
31000302013 has 4 divisors (see below), whose sum is σ = 31006377280. Its totient is φ = 30994226748.
The previous prime is 31000301947. The next prime is 31000302029. The reversal of 31000302013 is 31020300013.
It is a semiprime because it is the product of two primes, and also a Blum integer, because the two primes are equal to 3 mod 4.
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-31000302013 is a prime.
It is a super-2 number, since 2×310003020132 (a number of 22 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 = 31000301984 and 31000302002.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (31000102013) by changing a digit.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 3029973 + ... + 3040186.
It is an arithmetic number, because the mean of its divisors is an integer number (7751594320).
Almost surely, 231000302013 is an apocalyptic number.
It is an amenable number.
31000302013 is a deficient number, since it is larger than the sum of its proper divisors (6075267).
31000302013 is an equidigital number, since it uses as much as digits as its factorization.
31000302013 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 6075266.
The product of its (nonzero) digits is 54, while the sum is 13.
Adding to 31000302013 its reverse (31020300013), we get a palindrome (62020602026).
The spelling of 31000302013 in words is "thirty-one billion, three hundred two thousand, thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.064 sec. • engine limits •