Base | Representation |
---|---|
bin | 100011100111100100001101… |
… | …0100101000111100101010111 |
3 | 1112002022021222110020221110222 |
4 | 1013033020122211013211113 |
5 | 312031111203324441043 |
6 | 3030200315144304555 |
7 | 122664155034615350 |
oct | 10717103245074527 |
9 | 1462267873227428 |
10 | 313301130312023 |
11 | 90911299354687 |
12 | 2b17ba3677215b |
13 | 105a82291237c9 |
14 | 5751bd9b4cd27 |
15 | 2634a34a26d68 |
hex | 11cf21a947957 |
313301130312023 has 32 divisors (see below), whose sum is σ = 377050327296000. Its totient is φ = 254310923449440.
The previous prime is 313301130312019. The next prime is 313301130312041. The reversal of 313301130312023 is 320213031103313.
It is a cyclic number.
It is not a de Polignac number, because 313301130312023 - 22 = 313301130312019 is a prime.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 313301130311983 and 313301130312001.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (313301130312043) by changing a digit.
It is a polite number, since it can be written in 31 ways as a sum of consecutive naturals, for example, 7359475328 + ... + 7359517898.
It is an arithmetic number, because the mean of its divisors is an integer number (11782822728000).
Almost surely, 2313301130312023 is an apocalyptic number.
313301130312023 is a deficient number, since it is larger than the sum of its proper divisors (63749196983977).
313301130312023 is a wasteful number, since it uses less digits than its factorization.
313301130312023 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 62835.
The product of its (nonzero) digits is 2916, while the sum is 26.
Adding to 313301130312023 its reverse (320213031103313), we get a palindrome (633514161415336).
The spelling of 313301130312023 in words is "three hundred thirteen trillion, three hundred one billion, one hundred thirty million, three hundred twelve thousand, twenty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •