Base | Representation |
---|---|
bin | 10011001000101… |
… | …010111010010100 |
3 | 211101002112010010 |
4 | 103020222322110 |
5 | 1124141240040 |
6 | 51505000220 |
7 | 10645536510 |
oct | 2310527224 |
9 | 741075103 |
10 | 321040020 |
11 | 155245134 |
12 | 8b623070 |
13 | 51686712 |
14 | 308cd140 |
15 | 1d2b7e80 |
hex | 1322ae94 |
321040020 has 48 divisors (see below), whose sum is σ = 1027329408. Its totient is φ = 73380480.
The previous prime is 321040007. The next prime is 321040091. The reversal of 321040020 is 20040123.
It is a Harshad number since it is a multiple of its sum of digits (12).
It is a junction number, because it is equal to n+sod(n) for n = 321039978 and 321040005.
It is a congruent number.
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, 381771 + ... + 382610.
It is an arithmetic number, because the mean of its divisors is an integer number (21402696).
Almost surely, 2321040020 is an apocalyptic number.
321040020 is a gapful number since it is divisible by the number (30) formed by its first and last digit.
It is an amenable number.
321040020 is an abundant number, since it is smaller than the sum of its proper divisors (706289388).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
321040020 is a wasteful number, since it uses less digits than its factorization.
321040020 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 764400 (or 764398 counting only the distinct ones).
The product of its (nonzero) digits is 48, while the sum is 12.
The square root of 321040020 is about 17917.5896816508. The cubic root of 321040020 is about 684.7305811741.
Adding to 321040020 its reverse (20040123), we get a palindrome (341080143).
The spelling of 321040020 in words is "three hundred twenty-one million, forty thousand, twenty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.081 sec. • engine limits •