Base | Representation |
---|---|
bin | 1010010001010011… |
… | …11100001010111000 |
3 | 112020021102012221000 |
4 | 11020221330022320 |
5 | 42243030434313 |
6 | 2311050245000 |
7 | 253432362015 |
oct | 51051741270 |
9 | 15207365830 |
10 | 5513921208 |
11 | 237a512684 |
12 | 109a726760 |
13 | 69b479293 |
14 | 3a443c70c |
15 | 22411e673 |
hex | 148a7c2b8 |
5513921208 has 128 divisors (see below), whose sum is σ = 15477696000. Its totient is φ = 1818754560.
The previous prime is 5513921173. The next prime is 5513921213. The reversal of 5513921208 is 8021293155.
5513921208 is a `hidden beast` number, since 551 + 3 + 92 + 12 + 0 + 8 = 666.
It is a Harshad number since it is a multiple of its sum of digits (36).
It is a congruent number.
It is an unprimeable number.
It is a polite number, since it can be written in 31 ways as a sum of consecutive naturals, for example, 15358933 + ... + 15359291.
It is an arithmetic number, because the mean of its divisors is an integer number (120919500).
Almost surely, 25513921208 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 5513921208, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (7738848000).
5513921208 is an abundant number, since it is smaller than the sum of its proper divisors (9963774792).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
5513921208 is a wasteful number, since it uses less digits than its factorization.
5513921208 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 922 (or 912 counting only the distinct ones).
The product of its (nonzero) digits is 21600, while the sum is 36.
The square root of 5513921208 is about 74255.7823203015. The cubic root of 5513921208 is about 1766.6622072432.
The spelling of 5513921208 in words is "five billion, five hundred thirteen million, nine hundred twenty-one thousand, two hundred eight".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •