Base | Representation |
---|---|
bin | 1001011001110100101… |
… | …00100101011100111101 |
3 | 1010212222110120112111000 |
4 | 10230322110211130331 |
5 | 20243202330201023 |
6 | 404233000120513 |
7 | 32225513241630 |
oct | 4547224453475 |
9 | 1125873515430 |
10 | 323101022013 |
11 | 115032116030 |
12 | 52751a66139 |
13 | 24611acb7c3 |
14 | 118d1209c17 |
15 | 86107c6243 |
hex | 4b3a52573d |
323101022013 has 32 divisors (see below), whose sum is σ = 596781112320. Its totient is φ = 167844685680.
The previous prime is 323101022011. The next prime is 323101022059. The reversal of 323101022013 is 310220101323.
It is not a de Polignac number, because 323101022013 - 21 = 323101022011 is a prime.
It is a super-2 number, since 2×3231010220132 (a number of 24 digits) contains 22 as substring.
It is a Curzon number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (323101022011) by changing a digit.
It is a polite number, since it can be written in 31 ways as a sum of consecutive naturals, for example, 77703795 + ... + 77707952.
It is an arithmetic number, because the mean of its divisors is an integer number (18649409760).
Almost surely, 2323101022013 is an apocalyptic number.
323101022013 is a gapful number since it is divisible by the number (33) formed by its first and last digit.
It is an amenable number.
323101022013 is a deficient number, since it is larger than the sum of its proper divisors (273680090307).
323101022013 is a wasteful number, since it uses less digits than its factorization.
323101022013 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 155411774 (or 155411768 counting only the distinct ones).
The product of its (nonzero) digits is 216, while the sum is 18.
Adding to 323101022013 its reverse (310220101323), we get a palindrome (633321123336).
The spelling of 323101022013 in words is "three hundred twenty-three billion, one hundred one million, twenty-two thousand, thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •