Base | Representation |
---|---|
bin | 1000100111011101… |
… | …1110011001100111 |
3 | 12222012100122100121 |
4 | 2021313132121213 |
5 | 14214113133111 |
6 | 1021304022411 |
7 | 111214232356 |
oct | 21167363147 |
9 | 5865318317 |
10 | 2313021031 |
11 | a87704a32 |
12 | 546761a07 |
13 | 2ab283ac9 |
14 | 17d29b99d |
15 | d80e4871 |
hex | 89dde667 |
2313021031 has 16 divisors (see below), whose sum is σ = 2472906240. Its totient is φ = 2157049440.
The previous prime is 2313021023. The next prime is 2313021047. The reversal of 2313021031 is 1301203132.
It is a cyclic number.
It is not a de Polignac number, because 2313021031 - 23 = 2313021023 is a prime.
It is a super-2 number, since 2×23130210312 = 10700132579696605922, which contains 22 as substring.
It is a junction number, because it is equal to n+sod(n) for n = 2313020996 and 2313021014.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (2313021731) 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 in 15 ways as a sum of consecutive naturals, for example, 1433181 + ... + 1434793.
It is an arithmetic number, because the mean of its divisors is an integer number (154556640).
Almost surely, 22313021031 is an apocalyptic number.
2313021031 is a deficient number, since it is larger than the sum of its proper divisors (159885209).
2313021031 is a wasteful number, since it uses less digits than its factorization.
2313021031 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 2766.
The product of its (nonzero) digits is 108, while the sum is 16.
The square root of 2313021031 is about 48093.8772714365. The cubic root of 2313021031 is about 1322.4924271564.
Adding to 2313021031 its reverse (1301203132), we get a palindrome (3614224163).
The spelling of 2313021031 in words is "two billion, three hundred thirteen million, twenty-one thousand, thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.067 sec. • engine limits •