Base | Representation |
---|---|
bin | 1001000111011100001… |
… | …01010010111110010001 |
3 | 1002221111200021211200021 |
4 | 10203232011102332101 |
5 | 20112444343324103 |
6 | 355521413023441 |
7 | 31426116110335 |
oct | 4435605227621 |
9 | 1087450254607 |
10 | 313232011153 |
11 | 110928339106 |
12 | 50858924b81 |
13 | 236cb2b50c9 |
14 | 112366237c5 |
15 | 823418ebbd |
hex | 48ee152f91 |
313232011153 has 2 divisors, whose sum is σ = 313232011154. Its totient is φ = 313232011152.
The previous prime is 313232011129. The next prime is 313232011163. The reversal of 313232011153 is 351110232313.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 262495349649 + 50736661504 = 512343^2 + 225248^2 .
It is a cyclic number.
It is not a de Polignac number, because 313232011153 - 25 = 313232011121 is a prime.
It is a super-2 number, since 2×3132320111532 (a number of 24 digits) contains 22 as substring.
It is not a weakly prime, because it can be changed into another prime (313232011163) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 156616005576 + 156616005577.
It is an arithmetic number, because the mean of its divisors is an integer number (156616005577).
Almost surely, 2313232011153 is an apocalyptic number.
It is an amenable number.
313232011153 is a deficient number, since it is larger than the sum of its proper divisors (1).
313232011153 is an equidigital number, since it uses as much as digits as its factorization.
313232011153 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 1620, while the sum is 25.
Adding to 313232011153 its reverse (351110232313), we get a palindrome (664342243466).
The spelling of 313232011153 in words is "three hundred thirteen billion, two hundred thirty-two million, eleven thousand, one hundred fifty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.095 sec. • engine limits •