Base | Representation |
---|---|
bin | 1011010100010… |
… | …1000111001000 |
3 | 10022022200020010 |
4 | 2311011013020 |
5 | 44123002000 |
6 | 4413231520 |
7 | 1114323405 |
oct | 265050710 |
9 | 108280203 |
10 | 47469000 |
11 | 24882187 |
12 | 13a925a0 |
13 | 9ab0387 |
14 | 64392ac |
15 | 4279d50 |
hex | 2d451c8 |
47469000 has 64 divisors (see below), whose sum is σ = 148112640. Its totient is φ = 12657600.
The previous prime is 47468999. The next prime is 47469007. The reversal of 47469000 is 96474.
47469000 = T487 + T488 + ... + T736.
It is a super-2 number, since 2×474690002 = 4506611922000000, which contains 22 as substring.
It is a Harshad number since it is a multiple of its sum of digits (30).
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (47469007) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (11) of ones.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 4912 + ... + 10911.
It is an arithmetic number, because the mean of its divisors is an integer number (2314260).
Almost surely, 247469000 is an apocalyptic number.
47469000 is a gapful number since it is divisible by the number (40) formed by its first and last digit.
It is an amenable number.
47469000 is an abundant number, since it is smaller than the sum of its proper divisors (100643640).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
47469000 is a wasteful number, since it uses less digits than its factorization.
47469000 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 15847 (or 15833 counting only the distinct ones).
The product of its (nonzero) digits is 6048, while the sum is 30.
The square root of 47469000 is about 6889.7750326117. The cubic root of 47469000 is about 362.0790198162.
The spelling of 47469000 in words is "forty-seven million, four hundred sixty-nine thousand".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.200 sec. • engine limits •