Base | Representation |
---|---|
bin | 100001110011011111011… |
… | …101001111000110000101 |
3 | 22020002011001021022101122 |
4 | 201303133131033012011 |
5 | 301030032004314023 |
6 | 4535104051203325 |
7 | 326555611305632 |
oct | 41633735170605 |
9 | 8202131238348 |
10 | 2323031323013 |
11 | 816212690a35 |
12 | 3162765a6545 |
13 | 13b0a3a9b35b |
14 | 80614715189 |
15 | 406625d72c8 |
hex | 21cdf74f185 |
2323031323013 has 8 divisors (see below), whose sum is σ = 2327468130816. Its totient is φ = 2318598090000.
The previous prime is 2323031323007. The next prime is 2323031323037. The reversal of 2323031323013 is 3103231303232.
It is a happy number.
It is a sphenic number, since it is the product of 3 distinct primes.
It is a cyclic number.
It is not a de Polignac number, because 2323031323013 - 220 = 2323030274437 is a prime.
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (2323031323073) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (23) of ones.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 409028 + ... + 2193938.
It is an arithmetic number, because the mean of its divisors is an integer number (290933516352).
Almost surely, 22323031323013 is an apocalyptic number.
It is an amenable number.
2323031323013 is a deficient number, since it is larger than the sum of its proper divisors (4436807803).
2323031323013 is a wasteful number, since it uses less digits than its factorization.
2323031323013 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1787395.
The product of its (nonzero) digits is 5832, while the sum is 26.
Adding to 2323031323013 its reverse (3103231303232), we get a palindrome (5426262626245).
The spelling of 2323031323013 in words is "two trillion, three hundred twenty-three billion, thirty-one million, three hundred twenty-three thousand, thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.074 sec. • engine limits •