Base | Representation |
---|---|
bin | 1001011010001110111… |
… | …00100010100010010111 |
3 | 1010220112210220022000211 |
4 | 10231013130202202113 |
5 | 20244130212223111 |
6 | 404310503350251 |
7 | 32234125643260 |
oct | 4550734424227 |
9 | 1126483808024 |
10 | 323321211031 |
11 | 115135438325 |
12 | 527b3752387 |
13 | 24648604270 |
14 | 11912565967 |
15 | 8624cbc521 |
hex | 4b47722897 |
323321211031 has 32 divisors (see below), whose sum is σ = 398872251008. Its totient is φ = 255212052480.
The previous prime is 323321211007. The next prime is 323321211089. The reversal of 323321211031 is 130112123323.
It is not a de Polignac number, because 323321211031 - 29 = 323321210519 is a prime.
It is a super-2 number, since 2×3233212110312 (a number of 24 digits) contains 22 as substring.
It is a junction number, because it is equal to n+sod(n) for n = 323321210993 and 323321211011.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (323321221031) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written in 31 ways as a sum of consecutive naturals, for example, 136019515 + ... + 136021891.
It is an arithmetic number, because the mean of its divisors is an integer number (12464757844).
Almost surely, 2323321211031 is an apocalyptic number.
323321211031 is a deficient number, since it is larger than the sum of its proper divisors (75551039977).
323321211031 is a wasteful number, since it uses less digits than its factorization.
323321211031 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 5291.
The product of its (nonzero) digits is 648, while the sum is 22.
Adding to 323321211031 its reverse (130112123323), we get a palindrome (453433334354).
The spelling of 323321211031 in words is "three hundred twenty-three billion, three hundred twenty-one million, two hundred eleven thousand, thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.062 sec. • engine limits •