Base | Representation |
---|---|
bin | 1010010110010101… |
… | …11000011100101110 |
3 | 112100012210200122110 |
4 | 11023022320130232 |
5 | 42334331024100 |
6 | 2315154424450 |
7 | 254454110532 |
oct | 51312703456 |
9 | 15305720573 |
10 | 5556111150 |
11 | 23a13095a7 |
12 | 10b0892126 |
13 | 6a712b845 |
14 | 3a9ca1bc2 |
15 | 227ba5250 |
hex | 14b2b872e |
5556111150 has 48 divisors (see below), whose sum is σ = 14378258304. Its totient is φ = 1417210080.
The previous prime is 5556111107. The next prime is 5556111167. The reversal of 5556111150 is 511116555.
It is a super-2 number, since 2×55561111502 = 61740742222308645000, which contains 22 as substring.
It is a Harshad number since it is a multiple of its sum of digits (30).
It is a Curzon number.
It is a congruent number.
It is an unprimeable number.
It is a pernicious number, because its binary representation contains a prime number (17) of ones.
It is a polite number, since it can be written in 23 ways as a sum of consecutive naturals, for example, 801784 + ... + 808683.
It is an arithmetic number, because the mean of its divisors is an integer number (299547048).
Almost surely, 25556111150 is an apocalyptic number.
5556111150 is a gapful number since it is divisible by the number (50) formed by its first and last digit.
5556111150 is an abundant number, since it is smaller than the sum of its proper divisors (8822147154).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
5556111150 is a wasteful number, since it uses less digits than its factorization.
5556111150 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1610505 (or 1610500 counting only the distinct ones).
The product of its (nonzero) digits is 3750, while the sum is 30.
The square root of 5556111150 is about 74539.3261976522. The cubic root of 5556111150 is about 1771.1566540560.
The spelling of 5556111150 in words is "five billion, five hundred fifty-six million, one hundred eleven thousand, one hundred fifty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.062 sec. • engine limits •