Base | Representation |
---|---|
bin | 1001000111011000011… |
… | …11110011011101010111 |
3 | 1002221102112100001010010 |
4 | 10203230033303131113 |
5 | 20112414002224343 |
6 | 355514352531303 |
7 | 31425263240535 |
oct | 4435417633527 |
9 | 1087375301103 |
10 | 313201211223 |
11 | 110911a1171a |
12 | 5084a550b33 |
13 | 236c4abccb4 |
14 | 112324c7155 |
15 | 8231608d33 |
hex | 48ec3f3757 |
313201211223 has 32 divisors (see below), whose sum is σ = 426020912640. Its totient is φ = 204629483520.
The previous prime is 313201211209. The next prime is 313201211233. The reversal of 313201211223 is 322112102313.
It is not a de Polignac number, because 313201211223 - 213 = 313201203031 is a prime.
It is a super-2 number, since 2×3132012112232 (a number of 24 digits) contains 22 as substring.
It is a self number, because there is not a number n which added to its sum of digits gives 313201211223.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (313201211233) 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 31 ways as a sum of consecutive naturals, for example, 69893143 + ... + 69897623.
It is an arithmetic number, because the mean of its divisors is an integer number (13313153520).
Almost surely, 2313201211223 is an apocalyptic number.
313201211223 is a deficient number, since it is larger than the sum of its proper divisors (112819701417).
313201211223 is a wasteful number, since it uses less digits than its factorization.
313201211223 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 6519.
The product of its (nonzero) digits is 432, while the sum is 21.
Adding to 313201211223 its reverse (322112102313), we get a palindrome (635313313536).
The spelling of 313201211223 in words is "three hundred thirteen billion, two hundred one million, two hundred eleven thousand, two hundred twenty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •