Base | Representation |
---|---|
bin | 1001000111011100001… |
… | …01010010101101110101 |
3 | 1002221111200021210020022 |
4 | 10203232011102231311 |
5 | 20112444343310401 |
6 | 355521413014525 |
7 | 31426116104303 |
oct | 4435605225565 |
9 | 1087450253208 |
10 | 313232010101 |
11 | 11092833833a |
12 | 50858924445 |
13 | 236cb2b479a |
14 | 11236623273 |
15 | 823418e71b |
hex | 48ee152b75 |
313232010101 has 2 divisors, whose sum is σ = 313232010102. Its totient is φ = 313232010100.
The previous prime is 313232010089. The next prime is 313232010211. The reversal of 313232010101 is 101010232313.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 272457900625 + 40774109476 = 521975^2 + 201926^2 .
It is a cyclic number.
It is not a de Polignac number, because 313232010101 - 218 = 313231747957 is a prime.
It is a super-2 number, since 2×3132320101012 (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 313232010101.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (313232010601) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 156616005050 + 156616005051.
It is an arithmetic number, because the mean of its divisors is an integer number (156616005051).
Almost surely, 2313232010101 is an apocalyptic number.
It is an amenable number.
313232010101 is a deficient number, since it is larger than the sum of its proper divisors (1).
313232010101 is an equidigital number, since it uses as much as digits as its factorization.
313232010101 is an evil number, because the sum of its binary digits is even.
The product of its (nonzero) digits is 108, while the sum is 17.
Adding to 313232010101 its reverse (101010232313), we get a palindrome (414242242414).
The spelling of 313232010101 in words is "three hundred thirteen billion, two hundred thirty-two million, ten thousand, one hundred one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.074 sec. • engine limits •