Base | Representation |
---|---|
bin | 101100010111101010… |
… | …001110000111100110 |
3 | 11112222020001020012220 |
4 | 230113222032013212 |
5 | 1240032221142402 |
6 | 33515232253210 |
7 | 3304413532440 |
oct | 542752160746 |
9 | 145866036186 |
10 | 47641584102 |
11 | 19228483302 |
12 | 92970a1206 |
13 | 4653283968 |
14 | 243d417490 |
15 | 138c7d4dbc |
hex | b17a8e1e6 |
47641584102 has 16 divisors (see below), whose sum is σ = 108895049472. Its totient is φ = 13611881160.
The previous prime is 47641584101. The next prime is 47641584121. The reversal of 47641584102 is 20148514674.
It is a Harshad number since it is a multiple of its sum of digits (42), and also a Moran number because the ratio is a prime number: 1134323431 = 47641584102 / (4 + 7 + 6 + 4 + 1 + 5 + 8 + 4 + 1 + 0 + 2).
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (47641584101) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 567161674 + ... + 567161757.
It is an arithmetic number, because the mean of its divisors is an integer number (6805940592).
Almost surely, 247641584102 is an apocalyptic number.
47641584102 is a gapful number since it is divisible by the number (42) formed by its first and last digit.
47641584102 is an abundant number, since it is smaller than the sum of its proper divisors (61253465370).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
47641584102 is a wasteful number, since it uses less digits than its factorization.
47641584102 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1134323443.
The product of its (nonzero) digits is 215040, while the sum is 42.
The spelling of 47641584102 in words is "forty-seven billion, six hundred forty-one million, five hundred eighty-four thousand, one hundred two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •