Base | Representation |
---|---|
bin | 1010010001100111… |
… | …00111001001000000 |
3 | 112020110012000201011 |
4 | 11020303213021000 |
5 | 42244203102022 |
6 | 2311220450304 |
7 | 253463051410 |
oct | 51063471100 |
9 | 15213160634 |
10 | 5516456512 |
11 | 2380994476 |
12 | 109b549994 |
13 | 69bb56268 |
14 | 3a48dc640 |
15 | 224470977 |
hex | 148ce7240 |
5516456512 has 56 divisors (see below), whose sum is σ = 12563124480. Its totient is φ = 2354257920.
The previous prime is 5516456471. The next prime is 5516456521. The reversal of 5516456512 is 2156546155.
It is a tau number, because it is divible by the number of its divisors (56).
It is a super-2 number, since 2×55164565122 = 60862584897574412288, which contains 22 as substring.
It is an unprimeable number.
It is a pernicious number, because its binary representation contains a prime number (13) of ones.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 81312 + ... + 132832.
Almost surely, 25516456512 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 5516456512, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (6281562240).
5516456512 is an abundant number, since it is smaller than the sum of its proper divisors (7046667968).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
5516456512 is a wasteful number, since it uses less digits than its factorization.
5516456512 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 51779 (or 51769 counting only the distinct ones).
The product of its digits is 180000, while the sum is 40.
The square root of 5516456512 is about 74272.8517831381. The cubic root of 5516456512 is about 1766.9329365047.
The spelling of 5516456512 in words is "five billion, five hundred sixteen million, four hundred fifty-six thousand, five hundred twelve".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.074 sec. • engine limits •