Base | Representation |
---|---|
bin | 1001000111011100000… |
… | …01110100100100111111 |
3 | 1002221111121120120010010 |
4 | 10203232001310210333 |
5 | 20112444130201343 |
6 | 355521341314303 |
7 | 31426105264506 |
oct | 4435601644477 |
9 | 1087447516103 |
10 | 313231100223 |
11 | 110927876778 |
12 | 50858565993 |
13 | 236cb0565b2 |
14 | 1123646783d |
15 | 823405ed33 |
hex | 48ee07493f |
313231100223 has 8 divisors (see below), whose sum is σ = 417691356208. Its totient is φ = 208795788864.
The previous prime is 313231100183. The next prime is 313231100233. The reversal of 313231100223 is 322001132313.
It is a sphenic number, since it is the product of 3 distinct primes.
It is not a de Polignac number, because 313231100223 - 216 = 313231034687 is a prime.
It is a super-2 number, since 2×3132311002232 (a number of 24 digits) contains 22 as substring.
It is a Duffinian number.
It is a self number, because there is not a number n which added to its sum of digits gives 313231100223.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (313231100233) 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, 6206836 + ... + 6257097.
It is an arithmetic number, because the mean of its divisors is an integer number (52211419526).
Almost surely, 2313231100223 is an apocalyptic number.
313231100223 is a deficient number, since it is larger than the sum of its proper divisors (104460255985).
313231100223 is a wasteful number, since it uses less digits than its factorization.
313231100223 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 12472313.
The product of its (nonzero) digits is 648, while the sum is 21.
Adding to 313231100223 its reverse (322001132313), we get a palindrome (635232232536).
The spelling of 313231100223 in words is "three hundred thirteen billion, two hundred thirty-one million, one hundred thousand, two hundred twenty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •