Base | Representation |
---|---|
bin | 1001010110000000011… |
… | …01000001110010001000 |
3 | 1010200200200101122020102 |
4 | 10223000031001302020 |
5 | 20230003332024202 |
6 | 403253411144532 |
7 | 32123654563550 |
oct | 4530015016210 |
9 | 1120620348212 |
10 | 321052220552 |
11 | 114180677188 |
12 | 5227b8a5148 |
13 | 243764c874b |
14 | 1177908a160 |
15 | 85409c3d02 |
hex | 4ac0341c88 |
321052220552 has 64 divisors (see below), whose sum is σ = 697602499200. Its totient is φ = 135668252160.
The previous prime is 321052220539. The next prime is 321052220639. The reversal of 321052220552 is 255022250123.
It is an unprimeable number.
It is a pernicious number, because its binary representation contains a prime number (13) of ones.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 16419902 + ... + 16439442.
It is an arithmetic number, because the mean of its divisors is an integer number (10900039050).
Almost surely, 2321052220552 is an apocalyptic number.
It is an amenable number.
It is a practical number, because each smaller number is the sum of distinct divisors of 321052220552, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (348801249600).
321052220552 is an abundant number, since it is smaller than the sum of its proper divisors (376550278648).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
321052220552 is a wasteful number, since it uses less digits than its factorization.
321052220552 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 23646 (or 23642 counting only the distinct ones).
The product of its (nonzero) digits is 12000, while the sum is 29.
Adding to 321052220552 its reverse (255022250123), we get a palindrome (576074470675).
The spelling of 321052220552 in words is "three hundred twenty-one billion, fifty-two million, two hundred twenty thousand, five hundred fifty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •