Base | Representation |
---|---|
bin | 100001010010010011… |
… | …1100011010100100000 |
3 | 20211111122200201001110 |
4 | 1002210213203110200 |
5 | 2132343203332243 |
6 | 52501004303320 |
7 | 5110242045114 |
oct | 1024447432440 |
9 | 224448621043 |
10 | 71481308448 |
11 | 28351376030 |
12 | 11a2ab41b40 |
13 | 69822c3c24 |
14 | 3661651744 |
15 | 1cd56b6e33 |
hex | 10a49e3520 |
71481308448 has 192 divisors, whose sum is σ = 213970885632. Its totient is φ = 20682900480.
The previous prime is 71481308447. The next prime is 71481308461. The reversal of 71481308448 is 84480318417.
It is a Harshad number since it is a multiple of its sum of digits (48).
It is a junction number, because it is equal to n+sod(n) for n = 71481308397 and 71481308406.
It is not an unprimeable number, because it can be changed into a prime (71481308447) by changing a digit.
It is a polite number, since it can be written in 31 ways as a sum of consecutive naturals, for example, 15857811 + ... + 15862317.
It is an arithmetic number, because the mean of its divisors is an integer number (1114431696).
Almost surely, 271481308448 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 71481308448, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (106985442816).
71481308448 is an abundant number, since it is smaller than the sum of its proper divisors (142489577184).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
71481308448 is a wasteful number, since it uses less digits than its factorization.
71481308448 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 5207 (or 5199 counting only the distinct ones).
The product of its (nonzero) digits is 688128, while the sum is 48.
The spelling of 71481308448 in words is "seventy-one billion, four hundred eighty-one million, three hundred eight thousand, four hundred forty-eight".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •