Base | Representation |
---|---|
bin | 11011111110110… |
… | …000010001011000 |
3 | 1012201022210102021 |
4 | 123332300101120 |
5 | 1430133413410 |
6 | 114325344224 |
7 | 14430064363 |
oct | 3376602130 |
9 | 1181283367 |
10 | 469435480 |
11 | 220a90908 |
12 | 111268074 |
13 | 76343197 |
14 | 464bb0da |
15 | 2b32beda |
hex | 1bfb0458 |
469435480 has 64 divisors (see below), whose sum is σ = 1094446080. Its totient is φ = 181027200.
The previous prime is 469435453. The next prime is 469435481. The reversal of 469435480 is 84534964.
It is a happy number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (469435481) 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, 429735 + ... + 430825.
It is an arithmetic number, because the mean of its divisors is an integer number (17100720).
Almost surely, 2469435480 is an apocalyptic number.
469435480 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 469435480, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (547223040).
469435480 is an abundant number, since it is smaller than the sum of its proper divisors (625010600).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
469435480 is a wasteful number, since it uses less digits than its factorization.
469435480 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1480 (or 1476 counting only the distinct ones).
The product of its (nonzero) digits is 414720, while the sum is 43.
The square root of 469435480 is about 21666.4597938842. The cubic root of 469435480 is about 777.1865990811.
The spelling of 469435480 in words is "four hundred sixty-nine million, four hundred thirty-five thousand, four hundred eighty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •