Base | Representation |
---|---|
bin | 101000000011111110111… |
… | …0010101000100010001010 |
3 | 201111101020100021120100110 |
4 | 1100013331302220202022 |
5 | 1210203003404440200 |
6 | 15413250020015150 |
7 | 1105542364260102 |
oct | 120077562504212 |
9 | 21441210246313 |
10 | 5506111015050 |
11 | 1833146140018 |
12 | 74b1555314b6 |
13 | 30c2bb2aa179 |
14 | 1506d6436202 |
15 | 9835eabab50 |
hex | 501fdca888a |
5506111015050 has 48 divisors (see below), whose sum is σ = 13655494912032. Its totient is φ = 1468259755200.
The previous prime is 5506111015049. The next prime is 5506111015099. The reversal of 5506111015050 is 505101116055.
It is a Harshad number since it is a multiple of its sum of digits (30).
It is a junction number, because it is equal to n+sod(n) for n = 5506111014999 and 5506111015017.
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 23 ways as a sum of consecutive naturals, for example, 5888185 + ... + 6758915.
It is an arithmetic number, because the mean of its divisors is an integer number (284489477334).
Almost surely, 25506111015050 is an apocalyptic number.
5506111015050 is a gapful number since it is divisible by the number (50) formed by its first and last digit.
5506111015050 is an abundant number, since it is smaller than the sum of its proper divisors (8149383896982).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
5506111015050 is a wasteful number, since it uses less digits than its factorization.
5506111015050 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 912903 (or 912898 counting only the distinct ones).
The product of its (nonzero) digits is 3750, while the sum is 30.
The spelling of 5506111015050 in words is "five trillion, five hundred six billion, one hundred eleven million, fifteen thousand, fifty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.077 sec. • engine limits •