Base | Representation |
---|---|
bin | 11011111111111… |
… | …011000000101000 |
3 | 1012201220100100100 |
4 | 123333323000220 |
5 | 1430223212413 |
6 | 114340105400 |
7 | 14432511030 |
oct | 3377730050 |
9 | 1181810310 |
10 | 469741608 |
11 | 22117a906 |
12 | 111395260 |
13 | 7641c61b |
14 | 4655a8c0 |
15 | 2b38ca73 |
hex | 1bffb028 |
469741608 has 96 divisors (see below), whose sum is σ = 1462930560. Its totient is φ = 133384320.
The previous prime is 469741577. The next prime is 469741619. The reversal of 469741608 is 806147964.
It is a hoax number, since the sum of its digits (45) coincides with the sum of the digits of its distinct prime factors.
It is an unprimeable number.
It is a pernicious number, because its binary representation contains a prime number (17) of ones.
It is a polite number, since it can be written in 23 ways as a sum of consecutive naturals, for example, 81378 + ... + 86958.
It is an arithmetic number, because the mean of its divisors is an integer number (15238860).
Almost surely, 2469741608 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 469741608, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (731465280).
469741608 is an abundant number, since it is smaller than the sum of its proper divisors (993188952).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
469741608 is a wasteful number, since it uses less digits than its factorization.
469741608 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 5767 (or 5760 counting only the distinct ones).
The product of its (nonzero) digits is 290304, while the sum is 45.
The square root of 469741608 is about 21673.5232022853. The cubic root of 469741608 is about 777.3555018668.
The spelling of 469741608 in words is "four hundred sixty-nine million, seven hundred forty-one thousand, six hundred eight".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.067 sec. • engine limits •