Base | Representation |
---|---|
bin | 100001010010001000… |
… | …0011101001001011000 |
3 | 20211111020022002201000 |
4 | 1002210100131021120 |
5 | 2132340131110343 |
6 | 52500230425000 |
7 | 5110136430165 |
oct | 1024420351130 |
9 | 224436262630 |
10 | 71475253848 |
11 | 28348a10129 |
12 | 11a28b02160 |
13 | 6980c8411b |
14 | 366091706c |
15 | 1cd4dbced3 |
hex | 10a441d258 |
71475253848 has 64 divisors (see below), whose sum is σ = 198602956800. Its totient is φ = 23817814560.
The previous prime is 71475253847. The next prime is 71475253933. The reversal of 71475253848 is 84835257417.
71475253848 is a `hidden beast` number, since 7 + 1 + 47 + 525 + 38 + 48 = 666.
It is a Harshad number since it is a multiple of its sum of digits (54).
It is a junction number, because it is equal to n+sod(n) for n = 71475253794 and 71475253803.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (71475253841) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (13) of ones.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 683665 + ... + 781247.
It is an arithmetic number, because the mean of its divisors is an integer number (3103171200).
Almost surely, 271475253848 is an apocalyptic number.
It is an amenable number.
71475253848 is an abundant number, since it is smaller than the sum of its proper divisors (127127702952).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
71475253848 is a wasteful number, since it uses less digits than its factorization.
71475253848 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 100989 (or 100979 counting only the distinct ones).
The product of its digits is 7526400, while the sum is 54.
The spelling of 71475253848 in words is "seventy-one billion, four hundred seventy-five million, two hundred fifty-three thousand, eight hundred forty-eight".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •