Base | Representation |
---|---|
bin | 100011100110000111001010… |
… | …0100010111111000011001111 |
3 | 1112001121012012211221100222021 |
4 | 1013030032110202333003033 |
5 | 312014322442124011343 |
6 | 3025524431344231011 |
7 | 122643552263462611 |
oct | 10714162442770317 |
9 | 1461535184840867 |
10 | 313101313110223 |
11 | 90844580797480 |
12 | 2b14917030b467 |
13 | 10592433948061 |
14 | 5746282052db1 |
15 | 262e73c6600ed |
hex | 11cc3948bf0cf |
313101313110223 has 8 divisors (see below), whose sum is σ = 347164496206416. Its totient is φ = 279971367907200.
The previous prime is 313101313110041. The next prime is 313101313110247. The reversal of 313101313110223 is 322011313101313.
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 313101313110223 - 225 = 313101279555791 is a prime.
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (313101313110263) by changing a digit.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 233309472586 + ... + 233309473927.
It is an arithmetic number, because the mean of its divisors is an integer number (43395562025802).
Almost surely, 2313101313110223 is an apocalyptic number.
313101313110223 is a deficient number, since it is larger than the sum of its proper divisors (34063183096193).
313101313110223 is a wasteful number, since it uses less digits than its factorization.
313101313110223 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 466618946585.
The product of its (nonzero) digits is 972, while the sum is 25.
Adding to 313101313110223 its reverse (322011313101313), we get a palindrome (635112626211536).
The spelling of 313101313110223 in words is "three hundred thirteen trillion, one hundred one billion, three hundred thirteen million, one hundred ten thousand, two hundred twenty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •