Base | Representation |
---|---|
bin | 1001011001101011000… |
… | …00101101001000011000 |
3 | 1010212202211201002200110 |
4 | 10230311200231020120 |
5 | 20243021200004422 |
6 | 404220554204320 |
7 | 32223513234000 |
oct | 4546540551030 |
9 | 1125684632613 |
10 | 323020313112 |
11 | 114aa0600262 |
12 | 5272aa236a0 |
13 | 245cb180863 |
14 | 118c45db000 |
15 | 860868260c |
hex | 4b3582d218 |
323020313112 has 128 divisors (see below), whose sum is σ = 942078528000. Its totient is φ = 92259345024.
The previous prime is 323020313107. The next prime is 323020313141. The reversal of 323020313112 is 211313020323.
It is a Harshad number since it is a multiple of its sum of digits (21).
It is a congruent number.
It is an unprimeable number.
It is a polite number, since it can be written in 31 ways as a sum of consecutive naturals, for example, 33688783 + ... + 33698369.
It is an arithmetic number, because the mean of its divisors is an integer number (7359988500).
Almost surely, 2323020313112 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 323020313112, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (471039264000).
323020313112 is an abundant number, since it is smaller than the sum of its proper divisors (619058214888).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
323020313112 is a wasteful number, since it uses less digits than its factorization.
323020313112 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 13710 (or 13692 counting only the distinct ones).
The product of its (nonzero) digits is 648, while the sum is 21.
Adding to 323020313112 its reverse (211313020323), we get a palindrome (534333333435).
The spelling of 323020313112 in words is "three hundred twenty-three billion, twenty million, three hundred thirteen thousand, one hundred twelve".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •