Base | Representation |
---|---|
bin | 1001000111001110111… |
… | …10010101000111011111 |
3 | 1002221012221122122110212 |
4 | 10203213132111013133 |
5 | 20112233002224043 |
6 | 355502412323035 |
7 | 31423301500436 |
oct | 4434736250737 |
9 | 1087187578425 |
10 | 313121133023 |
11 | 110880797796 |
12 | 5082777347b |
13 | 236b133314a |
14 | 11225a0011d |
15 | 822958c018 |
hex | 48e77951df |
313121133023 has 2 divisors, whose sum is σ = 313121133024. Its totient is φ = 313121133022.
The previous prime is 313121133019. The next prime is 313121133053. The reversal of 313121133023 is 320331121313.
It is a weak prime.
It is a cyclic number.
It is not a de Polignac number, because 313121133023 - 22 = 313121133019 is a prime.
It is a super-2 number, since 2×3131211330232 (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 313121133023.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (313121133053) 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 as a sum of consecutive naturals, namely, 156560566511 + 156560566512.
It is an arithmetic number, because the mean of its divisors is an integer number (156560566512).
Almost surely, 2313121133023 is an apocalyptic number.
313121133023 is a deficient number, since it is larger than the sum of its proper divisors (1).
313121133023 is an equidigital number, since it uses as much as digits as its factorization.
313121133023 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 972, while the sum is 23.
Adding to 313121133023 its reverse (320331121313), we get a palindrome (633452254336).
The spelling of 313121133023 in words is "three hundred thirteen billion, one hundred twenty-one million, one hundred thirty-three thousand, twenty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •