Base | Representation |
---|---|
bin | 100111110110111100010… |
… | …0101111111001111001110 |
3 | 201101200221122220011022010 |
4 | 1033231320211333033032 |
5 | 1204223130232323140 |
6 | 15352335110402050 |
7 | 1103531405120301 |
oct | 117557045771716 |
9 | 21350848804263 |
10 | 5478106526670 |
11 | 1822285358448 |
12 | 74583a960326 |
13 | 30977747a49b |
14 | 14d1db038b38 |
15 | 97771269880 |
hex | 4fb7897f3ce |
5478106526670 has 32 divisors (see below), whose sum is σ = 13234524917760. Its totient is φ = 1451154045600.
The previous prime is 5478106526639. The next prime is 5478106526731. The reversal of 5478106526670 is 766256018745.
It is a super-2 number, since 2×54781065266702 (a number of 26 digits) contains 22 as substring.
It is a Smith number, since the sum of its digits (57) coincides with the sum of the digits of its prime factors. Since it is squarefree, it is also a hoax number.
It is a Curzon number.
It is a self number, because there is not a number n which added to its sum of digits gives 5478106526670.
It is a congruent number.
It is an unprimeable number.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 604642990 + ... + 604652049.
It is an arithmetic number, because the mean of its divisors is an integer number (413578903680).
Almost surely, 25478106526670 is an apocalyptic number.
5478106526670 is an abundant number, since it is smaller than the sum of its proper divisors (7756418391090).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
5478106526670 is a wasteful number, since it uses less digits than its factorization.
5478106526670 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 1209295200.
The product of its (nonzero) digits is 16934400, while the sum is 57.
The spelling of 5478106526670 in words is "five trillion, four hundred seventy-eight billion, one hundred six million, five hundred twenty-six thousand, six hundred seventy".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.079 sec. • engine limits •