Base | Representation |
---|---|
bin | 1010001110110000… |
… | …11011000000000000 |
3 | 112011210012112110000 |
4 | 11013120123000000 |
5 | 42222043123210 |
6 | 2305004240000 |
7 | 253052630130 |
oct | 50730330000 |
9 | 15153175400 |
10 | 5492551680 |
11 | 2369447410 |
12 | 1093540000 |
13 | 696c066a5 |
14 | 3a1678ac0 |
15 | 2222ecac0 |
hex | 14761b000 |
5492551680 has 1040 divisors, whose sum is σ = 25118717184. Its totient is φ = 1114767360.
The previous prime is 5492551679. The next prime is 5492551699. The reversal of 5492551680 is 861552945.
5492551680 is a `hidden beast` number, since 5 + 4 + 92 + 551 + 6 + 8 + 0 = 666.
It is a Harshad number since it is a multiple of its sum of digits (45).
It is an unprimeable number.
It is a pernicious number, because its binary representation contains a prime number (11) of ones.
It is a polite number, since it can be written in 79 ways as a sum of consecutive naturals, for example, 127733739 + ... + 127733781.
Almost surely, 25492551680 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 5492551680, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (12559358592).
5492551680 is an abundant number, since it is smaller than the sum of its proper divisors (19626165504).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
5492551680 is a wasteful number, since it uses less digits than its factorization.
5492551680 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 102 (or 71 counting only the distinct ones).
The product of its (nonzero) digits is 432000, while the sum is 45.
The square root of 5492551680 is about 74111.7512949195. The cubic root of 5492551680 is about 1764.3769845406.
The spelling of 5492551680 in words is "five billion, four hundred ninety-two million, five hundred fifty-one thousand, six hundred eighty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.080 sec. • engine limits •