Base | Representation |
---|---|
bin | 1001010111101011000110… |
… | …1010101011100000111011 |
3 | 1100110220001212012212211100 |
4 | 2111322301222223200323 |
5 | 2322243113424100243 |
6 | 33524452243302443 |
7 | 2112213621640455 |
oct | 225726152534073 |
9 | 40426055185740 |
10 | 10302312331323 |
11 | 3312205804041 |
12 | 11a47a767aa23 |
13 | 599672058ccc |
14 | 2788c53cd2d5 |
15 | 12cec060c0d3 |
hex | 95eb1aab83b |
10302312331323 has 48 divisors (see below), whose sum is σ = 15933670511616. Its totient is φ = 6399337633920.
The previous prime is 10302312331321. The next prime is 10302312331391. The reversal of 10302312331323 is 32313321320301.
10302312331323 is a `hidden beast` number, since 1 + 0 + 3 + 0 + 2 + 3 + 1 + 2 + 331 + 323 = 666.
It is not a de Polignac number, because 10302312331323 - 21 = 10302312331321 is a prime.
It is a super-2 number, since 2×103023123313232 (a number of 27 digits) contains 22 as substring.
It is not an unprimeable number, because it can be changed into a prime (10302312331321) by changing a digit.
It is a polite number, since it can be written in 47 ways as a sum of consecutive naturals, for example, 456490 + ... + 4562127.
It is an arithmetic number, because the mean of its divisors is an integer number (331951468992).
Almost surely, 210302312331323 is an apocalyptic number.
10302312331323 is a deficient number, since it is larger than the sum of its proper divisors (5631358180293).
10302312331323 is a wasteful number, since it uses less digits than its factorization.
10302312331323 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 5018904 (or 5018901 counting only the distinct ones).
The product of its (nonzero) digits is 5832, while the sum is 27.
Adding to 10302312331323 its reverse (32313321320301), we get a palindrome (42615633651624).
The spelling of 10302312331323 in words is "ten trillion, three hundred two billion, three hundred twelve million, three hundred thirty-one thousand, three hundred twenty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •