Base | Representation |
---|---|
bin | 1001011010001110111… |
… | …00100000010101100100 |
3 | 1010220112210212211200002 |
4 | 10231013130200111210 |
5 | 20244130211431040 |
6 | 404310503240432 |
7 | 32234125605065 |
oct | 4550734402544 |
9 | 1126483784602 |
10 | 323321202020 |
11 | 115135431583 |
12 | 527b3749118 |
13 | 2464860012b |
14 | 1191256256c |
15 | 8624cb9a15 |
hex | 4b47720564 |
323321202020 has 48 divisors (see below), whose sum is σ = 685952366400. Its totient is φ = 128000323200.
The previous prime is 323321202013. The next prime is 323321202023. The reversal of 323321202020 is 20202123323.
It is a Harshad number since it is a multiple of its sum of digits (20).
It is a junction number, because it is equal to n+sod(n) for n = 323321201983 and 323321202001.
It is not an unprimeable number, because it can be changed into a prime (323321202023) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (17) of ones.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 5665991 + ... + 5722769.
It is an arithmetic number, because the mean of its divisors is an integer number (14290674300).
Almost surely, 2323321202020 is an apocalyptic number.
It is an amenable number.
323321202020 is an abundant number, since it is smaller than the sum of its proper divisors (362631164380).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
323321202020 is a wasteful number, since it uses less digits than its factorization.
323321202020 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 59708 (or 59706 counting only the distinct ones).
The product of its (nonzero) digits is 864, while the sum is 20.
Adding to 323321202020 its reverse (20202123323), we get a palindrome (343523325343).
The spelling of 323321202020 in words is "three hundred twenty-three billion, three hundred twenty-one million, two hundred two thousand, twenty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •