Base | Representation |
---|---|
bin | 10000001001111101000… |
… | …10011111101001010010 |
3 | 1222001210212121021212000 |
4 | 20010332202133221102 |
5 | 33043321100323330 |
6 | 1103002011414430 |
7 | 55050616146162 |
oct | 10047642375122 |
9 | 1861725537760 |
10 | 555100011090 |
11 | 1a4464537349 |
12 | 8b6b9a54416 |
13 | 40465694c31 |
14 | 1cc1d00a5a2 |
15 | e68d0d7560 |
hex | 813e89fa52 |
555100011090 has 128 divisors (see below), whose sum is σ = 1494139046400. Its totient is φ = 146645717760.
The previous prime is 555100011071. The next prime is 555100011107. The reversal of 555100011090 is 90110001555.
555100011090 is a `hidden beast` number, since 5 + 551 + 0 + 0 + 0 + 1 + 109 + 0 = 666.
It is a Harshad number since it is a multiple of its sum of digits (27).
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 63 ways as a sum of consecutive naturals, for example, 12831216 + ... + 12874404.
It is an arithmetic number, because the mean of its divisors is an integer number (11672961300).
Almost surely, 2555100011090 is an apocalyptic number.
It is a practical number, because each smaller number is the sum of distinct divisors of 555100011090, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (747069523200).
555100011090 is an abundant number, since it is smaller than the sum of its proper divisors (939039035310).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
555100011090 is a wasteful number, since it uses less digits than its factorization.
555100011090 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 43649 (or 43643 counting only the distinct ones).
The product of its (nonzero) digits is 1125, while the sum is 27.
The spelling of 555100011090 in words is "five hundred fifty-five billion, one hundred million, eleven thousand, ninety".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •