Base | Representation |
---|---|
bin | 100011100110001111111101… |
… | …1101010011111101000011001 |
3 | 1112001200000000201020100122112 |
4 | 1013030133323222133220121 |
5 | 312020130204042013423 |
6 | 3025541240013002105 |
7 | 122645122011060053 |
oct | 10714377352375031 |
9 | 1461600021210575 |
10 | 313120223001113 |
11 | 908515a4947380 |
12 | 2b150969183335 |
13 | 10594158525cc8 |
14 | 57471576528d3 |
15 | 262ee9784aa78 |
hex | 11cc7fba9fa19 |
313120223001113 has 16 divisors (see below), whose sum is σ = 348854386533120. Its totient is φ = 278597539113600.
The previous prime is 313120223001013. The next prime is 313120223001133. The reversal of 313120223001113 is 311100322021313.
It is a cyclic number.
It is not a de Polignac number, because 313120223001113 - 216 = 313120222935577 is a prime.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (313120223001133) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (29) of ones.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 342681293 + ... + 343593813.
It is an arithmetic number, because the mean of its divisors is an integer number (21803399158320).
Almost surely, 2313120223001113 is an apocalyptic number.
It is an amenable number.
313120223001113 is a deficient number, since it is larger than the sum of its proper divisors (35734163532007).
313120223001113 is a wasteful number, since it uses less digits than its factorization.
313120223001113 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1576288.
The product of its (nonzero) digits is 648, while the sum is 23.
Adding to 313120223001113 its reverse (311100322021313), we get a palindrome (624220545022426).
The spelling of 313120223001113 in words is "three hundred thirteen trillion, one hundred twenty billion, two hundred twenty-three million, one thousand, one hundred thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.074 sec. • engine limits •