Base | Representation |
---|---|
bin | 1001011010001110111… |
… | …11100110010101101000 |
3 | 1010220112212102001011120 |
4 | 10231013133212111220 |
5 | 20244130413404112 |
6 | 404310532455240 |
7 | 32234135523414 |
oct | 4550737462550 |
9 | 1126485361146 |
10 | 323322013032 |
11 | 115135935937 |
12 | 527b3a7a520 |
13 | 24648825315 |
14 | 119126d3d44 |
15 | 8624dc9e8c |
hex | 4b477e6568 |
323322013032 has 32 divisors (see below), whose sum is σ = 808320720480. Its totient is φ = 107771912640.
The previous prime is 323322012989. The next prime is 323322013033. The reversal of 323322013032 is 230310223323.
It is a super-2 number, since 2×3233220130322 (a number of 24 digits) contains 22 as substring.
It is a Harshad number since it is a multiple of its sum of digits (24).
It is a junction number, because it is equal to n+sod(n) for n = 323322012993 and 323322013011.
It is not an unprimeable number, because it can be changed into a prime (323322013033) by changing a digit.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 1598307 + ... + 1789197.
It is an arithmetic number, because the mean of its divisors is an integer number (25260022515).
Almost surely, 2323322013032 is an apocalyptic number.
It is an amenable number.
323322013032 is an abundant number, since it is smaller than the sum of its proper divisors (484998707448).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
323322013032 is a wasteful number, since it uses less digits than its factorization.
323322013032 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 261473 (or 261469 counting only the distinct ones).
The product of its (nonzero) digits is 3888, while the sum is 24.
Adding to 323322013032 its reverse (230310223323), we get a palindrome (553632236355).
The spelling of 323322013032 in words is "three hundred twenty-three billion, three hundred twenty-two million, thirteen thousand, thirty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.077 sec. • engine limits •