Base | Representation |
---|---|
bin | 1001010111001001010… |
… | …10010011011111110000 |
3 | 1010202021022022220110221 |
4 | 10223210222103133300 |
5 | 20232231423000211 |
6 | 403434221102424 |
7 | 32145062553046 |
oct | 4534452233760 |
9 | 1122238286427 |
10 | 321663875056 |
11 | 114464965277 |
12 | 524106b7a14 |
13 | 24443144ca4 |
14 | 117d63c8396 |
15 | 8579544c71 |
hex | 4ae4a937f0 |
321663875056 has 80 divisors (see below), whose sum is σ = 653358539520. Its totient is φ = 153122112000.
The previous prime is 321663875051. The next prime is 321663875063. The reversal of 321663875056 is 650578366123.
It is a junction number, because it is equal to n+sod(n) for n = 321663874994 and 321663875012.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (321663875051) by changing a digit.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 98941431 + ... + 98944681.
It is an arithmetic number, because the mean of its divisors is an integer number (8166981744).
Almost surely, 2321663875056 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 321663875056, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (326679269760).
321663875056 is an abundant number, since it is smaller than the sum of its proper divisors (331694664464).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
321663875056 is a wasteful number, since it uses less digits than its factorization.
321663875056 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 4454 (or 4448 counting only the distinct ones).
The product of its (nonzero) digits is 5443200, while the sum is 52.
The spelling of 321663875056 in words is "three hundred twenty-one billion, six hundred sixty-three million, eight hundred seventy-five thousand, fifty-six".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •