Base | Representation |
---|---|
bin | 100100110001111101110… |
… | …1111100110100011100101 |
3 | 122220021002222002020201000 |
4 | 1021203323233212203211 |
5 | 1130310323401200010 |
6 | 14430141102023513 |
7 | 1031135134245312 |
oct | 111437357464345 |
9 | 18807088066630 |
10 | 5055105100005 |
11 | 1679949051824 |
12 | 697868577b99 |
13 | 2a89046a080c |
14 | 1369500d5d09 |
15 | 8b76537d7c0 |
hex | 498fbbe68e5 |
5055105100005 has 16 divisors (see below), whose sum is σ = 8986853511360. Its totient is φ = 2696056053264.
The previous prime is 5055105099991. The next prime is 5055105100007. The reversal of 5055105100005 is 5000015015505.
5055105100005 is a `hidden beast` number, since 5 + 0 + 551 + 0 + 5 + 100 + 0 + 0 + 5 = 666.
It is not a de Polignac number, because 5055105100005 - 214 = 5055105083621 is a prime.
It is a super-2 number, since 2×50551051000052 (a number of 26 digits) contains 22 as substring.
It is a Harshad number since it is a multiple of its sum of digits (27).
It is a Curzon number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (5055105100007) by changing a digit.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 18722611347 + ... + 18722611616.
It is an arithmetic number, because the mean of its divisors is an integer number (561678344460).
Almost surely, 25055105100005 is an apocalyptic number.
It is an amenable number.
5055105100005 is a deficient number, since it is larger than the sum of its proper divisors (3931748411355).
5055105100005 is a wasteful number, since it uses less digits than its factorization.
5055105100005 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 37445222977 (or 37445222971 counting only the distinct ones).
The product of its (nonzero) digits is 3125, while the sum is 27.
The spelling of 5055105100005 in words is "five trillion, fifty-five billion, one hundred five million, one hundred thousand, five".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.061 sec. • engine limits •