Base | Representation |
---|---|
bin | 100001110011100101011… |
… | …010101001111111001111 |
3 | 22020002102000102011210112 |
4 | 201303211122221333033 |
5 | 301030233103410111 |
6 | 4535122022230235 |
7 | 326561234215160 |
oct | 41634532517717 |
9 | 8202360364715 |
10 | 2323131310031 |
11 | 816264073734 |
12 | 3162a3b8537b |
13 | 13b0bb708c7c |
14 | 80623b01767 |
15 | 4066b287e8b |
hex | 21ce56a9fcf |
2323131310031 has 64 divisors (see below), whose sum is σ = 3023570073600. Its totient is φ = 1737018556416.
The previous prime is 2323131310009. The next prime is 2323131310063. The reversal of 2323131310031 is 1300131313232.
It is a cyclic number.
It is not a de Polignac number, because 2323131310031 - 226 = 2323064201167 is a prime.
It is a super-2 number, since 2×23231313100312 (a number of 26 digits) contains 22 as substring.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 2323131309979 and 2323131310006.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (2323131310001) by changing a digit.
It is a polite number, since it can be written in 63 ways as a sum of consecutive naturals, for example, 42273590 + ... + 42328508.
It is an arithmetic number, because the mean of its divisors is an integer number (47243282400).
Almost surely, 22323131310031 is an apocalyptic number.
2323131310031 is a deficient number, since it is larger than the sum of its proper divisors (700438763569).
2323131310031 is a wasteful number, since it uses less digits than its factorization.
2323131310031 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 55368.
The product of its (nonzero) digits is 972, while the sum is 23.
Adding to 2323131310031 its reverse (1300131313232), we get a palindrome (3623262623263).
The spelling of 2323131310031 in words is "two trillion, three hundred twenty-three billion, one hundred thirty-one million, three hundred ten thousand, thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.063 sec. • engine limits •