Base | Representation |
---|---|
bin | 100100101110111000001111… |
… | …1001000010010111101111111 |
3 | 1120101000021120100121010220021 |
4 | 1021131300133020102331333 |
5 | 314322202023413341111 |
6 | 3103103054013433011 |
7 | 125025241512515002 |
oct | 11135603710227577 |
9 | 1511007510533807 |
10 | 323102322012031 |
11 | 93a4aa1a574341 |
12 | 302a3489a9b767 |
13 | 10b39558b094a3 |
14 | 59b0343169539 |
15 | 2754975e41d71 |
hex | 125dc1f212f7f |
323102322012031 has 2 divisors, whose sum is σ = 323102322012032. Its totient is φ = 323102322012030.
The previous prime is 323102322011957. The next prime is 323102322012101. The reversal of 323102322012031 is 130210223201323.
It is a strong prime.
It is a cyclic number.
It is not a de Polignac number, because 323102322012031 - 217 = 323102321880959 is a prime.
It is a super-2 number, since 2×3231023220120312 (a number of 30 digits) contains 22 as substring.
It is a junction number, because it is equal to n+sod(n) for n = 323102322011987 and 323102322012005.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (323102322012131) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 161551161006015 + 161551161006016.
It is an arithmetic number, because the mean of its divisors is an integer number (161551161006016).
Almost surely, 2323102322012031 is an apocalyptic number.
323102322012031 is a deficient number, since it is larger than the sum of its proper divisors (1).
323102322012031 is an equidigital number, since it uses as much as digits as its factorization.
323102322012031 is an evil number, because the sum of its binary digits is even.
The product of its (nonzero) digits is 2592, while the sum is 25.
Adding to 323102322012031 its reverse (130210223201323), we get a palindrome (453312545213354).
The spelling of 323102322012031 in words is "three hundred twenty-three trillion, one hundred two billion, three hundred twenty-two million, twelve thousand, thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.097 sec. • engine limits •