Base | Representation |
---|---|
bin | 1101101001111111100… |
… | …00000010010010000000 |
3 | 1122212010211002002222000 |
4 | 12310333300002102000 |
5 | 30141431033222003 |
6 | 555320202144000 |
7 | 45620506424460 |
oct | 6647760022200 |
9 | 1585124062860 |
10 | 469220992128 |
11 | 170aa5021309 |
12 | 76b311b2000 |
13 | 3532a572995 |
14 | 189d3555ba0 |
15 | c31392c1a3 |
hex | 6d3fc02480 |
469220992128 has 512 divisors, whose sum is σ = 1642564915200. Its totient is φ = 129080770560.
The previous prime is 469220992109. The next prime is 469220992153. The reversal of 469220992128 is 821299022964.
It is a happy number.
It is a Harshad number since it is a multiple of its sum of digits (54).
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, 73855000 + ... + 73861352.
It is an arithmetic number, because the mean of its divisors is an integer number (3208134600).
Almost surely, 2469220992128 is an apocalyptic number.
469220992128 is a gapful number since it is divisible by the number (48) 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 469220992128, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (821282457600).
469220992128 is an abundant number, since it is smaller than the sum of its proper divisors (1173343923072).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
469220992128 is a wasteful number, since it uses less digits than its factorization.
469220992128 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 6497 (or 6479 counting only the distinct ones).
The product of its (nonzero) digits is 2239488, while the sum is 54.
The spelling of 469220992128 in words is "four hundred sixty-nine billion, two hundred twenty million, nine hundred ninety-two thousand, one hundred twenty-eight".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.090 sec. • engine limits •