Base | Representation |
---|---|
bin | 1101101010001000000… |
… | …11001110000101100000 |
3 | 1122212022211211002122000 |
4 | 12311010003032011200 |
5 | 30142103020130310 |
6 | 555331300244000 |
7 | 45622343534265 |
oct | 6650403160540 |
9 | 1585284732560 |
10 | 469293130080 |
11 | 171031812655 |
12 | 76b513a0600 |
13 | 3533c4ac668 |
14 | 189dcd7326c |
15 | c319e2b4c0 |
hex | 6d440ce160 |
469293130080 has 384 divisors, whose sum is σ = 1771973884800. Its totient is φ = 115560087552.
The previous prime is 469293130079. The next prime is 469293130109. The reversal of 469293130080 is 80031392964.
It is a happy number.
It is a Harshad number since it is a multiple of its sum of digits (45).
It is a congruent number.
It is an unprimeable number.
It is a polite number, since it can be written in 63 ways as a sum of consecutive naturals, for example, 3832036 + ... + 3952604.
It is an arithmetic number, because the mean of its divisors is an integer number (4614515325).
Almost surely, 2469293130080 is an apocalyptic number.
469293130080 is a gapful number since it is divisible by the number (40) formed by its first and last digit.
It is an amenable number.
It is a practical number, because each smaller number is the sum of distinct divisors of 469293130080, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (885986942400).
469293130080 is an abundant number, since it is smaller than the sum of its proper divisors (1302680754720).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
469293130080 is a wasteful number, since it uses less digits than its factorization.
469293130080 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 120663 (or 120649 counting only the distinct ones).
The product of its (nonzero) digits is 279936, while the sum is 45.
The spelling of 469293130080 in words is "four hundred sixty-nine billion, two hundred ninety-three million, one hundred thirty thousand, eighty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.085 sec. • engine limits •