Base | Representation |
---|---|
bin | 1000100111011110… |
… | …0001001010000001 |
3 | 12222012101012211202 |
4 | 2021313201022001 |
5 | 14214114013241 |
6 | 1021304150545 |
7 | 111214310315 |
oct | 21167411201 |
9 | 5865335752 |
10 | 2313032321 |
11 | a87712466 |
12 | 546768455 |
13 | 2ab288ca2 |
14 | 17d2a1b45 |
15 | d80e7d9b |
hex | 89de1281 |
2313032321 has 2 divisors, whose sum is σ = 2313032322. Its totient is φ = 2313032320.
The previous prime is 2313032251. The next prime is 2313032339. The reversal of 2313032321 is 1232303132.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 1394275600 + 918756721 = 37340^2 + 30311^2 .
It is a cyclic number.
It is not a de Polignac number, because 2313032321 - 210 = 2313031297 is a prime.
It is a junction number, because it is equal to n+sod(n) for n = 2313032293 and 2313032302.
It is not a weakly prime, because it can be changed into another prime (2313032021) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (13) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 1156516160 + 1156516161.
It is an arithmetic number, because the mean of its divisors is an integer number (1156516161).
Almost surely, 22313032321 is an apocalyptic number.
It is an amenable number.
2313032321 is a deficient number, since it is larger than the sum of its proper divisors (1).
2313032321 is an equidigital number, since it uses as much as digits as its factorization.
2313032321 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 648, while the sum is 20.
The square root of 2313032321 is about 48093.9946459015. The cubic root of 2313032321 is about 1322.4945788756.
Adding to 2313032321 its reverse (1232303132), we get a palindrome (3545335453).
The spelling of 2313032321 in words is "two billion, three hundred thirteen million, thirty-two thousand, three hundred twenty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.080 sec. • engine limits •