Base | Representation |
---|---|
bin | 1110000110111001011011… |
… | …00011010100011001011001 |
3 | 11001211210121000122220201122 |
4 | 13003130231203110121121 |
5 | 13031241221112343223 |
6 | 145551525132255025 |
7 | 6351234421441166 |
oct | 703345543243131 |
9 | 131753530586648 |
10 | 31023313012313 |
11 | 9980a05468176 |
12 | 3590638911475 |
13 | 144064159c71b |
14 | 793771ac106d |
15 | 38bec307e5c8 |
hex | 1c372d8d4659 |
31023313012313 has 8 divisors (see below), whose sum is σ = 31102810149600. Its totient is φ = 30943833658848.
The previous prime is 31023313012231. The next prime is 31023313012357. The reversal of 31023313012313 is 31321031332013.
It is a sphenic number, since it is the product of 3 distinct primes.
It is a cyclic number.
It is not a de Polignac number, because 31023313012313 - 234 = 31006133143129 is a prime.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (31023313014313) 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 in 7 ways as a sum of consecutive naturals, for example, 949031 + ... + 7933932.
It is an arithmetic number, because the mean of its divisors is an integer number (3887851268700).
Almost surely, 231023313012313 is an apocalyptic number.
It is an amenable number.
31023313012313 is a deficient number, since it is larger than the sum of its proper divisors (79497137287).
31023313012313 is an equidigital number, since it uses as much as digits as its factorization.
31023313012313 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 8891911.
The product of its (nonzero) digits is 2916, while the sum is 26.
Adding to 31023313012313 its reverse (31321031332013), we get a palindrome (62344344344326).
The spelling of 31023313012313 in words is "thirty-one trillion, twenty-three billion, three hundred thirteen million, twelve thousand, three hundred thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.075 sec. • engine limits •