Base | Representation |
---|---|
bin | 1001011001110100110… |
… | …01111010110000111111 |
3 | 1010212222120012120012110 |
4 | 10230322121322300333 |
5 | 20243203204420111 |
6 | 404233050105103 |
7 | 32225531153526 |
oct | 4547231726077 |
9 | 1125876176173 |
10 | 323102420031 |
11 | 115032990416 |
12 | 5275241b193 |
13 | 2461219ac31 |
14 | 118d14914bd |
15 | 86109a05a6 |
hex | 4b3a67ac3f |
323102420031 has 8 divisors (see below), whose sum is σ = 430805858224. Its totient is φ = 215400297600.
The previous prime is 323102420009. The next prime is 323102420033. The reversal of 323102420031 is 130024201323.
It is a sphenic number, since it is the product of 3 distinct primes.
It is not a de Polignac number, because 323102420031 - 213 = 323102411839 is a prime.
It is a super-2 number, since 2×3231024200312 (a number of 24 digits) contains 22 as substring.
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (323102420033) 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, 744081 + ... + 1095381.
It is an arithmetic number, because the mean of its divisors is an integer number (53850732278).
Almost surely, 2323102420031 is an apocalyptic number.
323102420031 is a deficient number, since it is larger than the sum of its proper divisors (107703438193).
323102420031 is a wasteful number, since it uses less digits than its factorization.
323102420031 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 657881.
The product of its (nonzero) digits is 864, while the sum is 21.
Adding to 323102420031 its reverse (130024201323), we get a palindrome (453126621354).
The spelling of 323102420031 in words is "three hundred twenty-three billion, one hundred two million, four hundred twenty thousand, thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.087 sec. • engine limits •