Base | Representation |
---|---|
bin | 101000000011111011111… |
… | …0011100101001001000000 |
3 | 201111100222100022221210112 |
4 | 1100013313303211021000 |
5 | 1210202302203200000 |
6 | 15413232031450452 |
7 | 1105540034615621 |
oct | 120076763451100 |
9 | 21440870287715 |
10 | 5506010600000 |
11 | 18330a4495779 |
12 | 74b127986a28 |
13 | 30c2a354c791 |
14 | 1506c6d77a48 |
15 | 98355d83235 |
hex | 501f7ce5240 |
5506010600000 has 84 divisors (see below), whose sum is σ = 13656613647348. Its totient is φ = 2202404160000.
The previous prime is 5506010599993. The next prime is 5506010600059. The reversal of 5506010600000 is 60106055.
It can be written as a sum of positive squares in 6 ways, for example, as 5120300044864 + 385710555136 = 2262808^2 + 621056^2 .
It is an unprimeable number.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written in 11 ways as a sum of consecutive naturals, for example, 13565027 + ... + 13965026.
It is an arithmetic number, because the mean of its divisors is an integer number (162578733897).
Almost surely, 25506010600000 is an apocalyptic number.
5506010600000 is a gapful number since it is divisible by the number (50) formed by its first and last digit.
It is an amenable number.
5506010600000 is an abundant number, since it is smaller than the sum of its proper divisors (8150603047348).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
5506010600000 is an frugal number, since it uses more digits than its factorization.
5506010600000 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 27530090 (or 27530060 counting only the distinct ones).
The product of its (nonzero) digits is 900, while the sum is 23.
Adding to 5506010600000 its reverse (60106055), we get a palindrome (5506070706055).
The spelling of 5506010600000 in words is "five trillion, five hundred six billion, ten million, six hundred thousand".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.076 sec. • engine limits •