Base | Representation |
---|---|
bin | 111010010010001000101… |
… | …1000111100101001000000 |
3 | 1001100210020221122202110020 |
4 | 1310210101120330221000 |
5 | 2022220302333301202 |
6 | 25011532443333440 |
7 | 1454506215341520 |
oct | 164442130745100 |
9 | 31323227582406 |
10 | 8010405759552 |
11 | 2609215247419 |
12 | a94578821280 |
13 | 4614bb68b631 |
14 | 1d99c4665680 |
15 | dd5807735bc |
hex | 7491163ca40 |
8010405759552 has 224 divisors, whose sum is σ = 25162571366400. Its totient is φ = 2200749557760.
The previous prime is 8010405759487. The next prime is 8010405759599. The reversal of 8010405759552 is 2559575040108.
It is a tau number, because it is divible by the number of its divisors (224).
It is a junction number, because it is equal to n+sod(n) for n = 8010405759495 and 8010405759504.
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 31 ways as a sum of consecutive naturals, for example, 5928949 + ... + 7153547.
Almost surely, 28010405759552 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 8010405759552, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (12581285683200).
8010405759552 is an abundant number, since it is smaller than the sum of its proper divisors (17152165606848).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
8010405759552 is a wasteful number, since it uses less digits than its factorization.
8010405759552 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1224809 (or 1224799 counting only the distinct ones).
The product of its (nonzero) digits is 2520000, while the sum is 51.
The spelling of 8010405759552 in words is "eight trillion, ten billion, four hundred five million, seven hundred fifty-nine thousand, five hundred fifty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.082 sec. • engine limits •