Base | Representation |
---|---|
bin | 100100011010101010001… |
… | …1000001011100111111111 |
3 | 122201110220201022222210210 |
4 | 1020311110120023213333 |
5 | 1124000321421300210 |
6 | 14351142301403503 |
7 | 1024413603341652 |
oct | 110652430134777 |
9 | 18643821288723 |
10 | 5005052525055 |
11 | 165a6a373a400 |
12 | 68a019b69593 |
13 | 2a3c88a8366b |
14 | 1343627db899 |
15 | 8a2d60a0e20 |
hex | 48d5460b9ff |
5005052525055 has 48 divisors (see below), whose sum is σ = 9320055085152. Its totient is φ = 2283945523200.
The previous prime is 5005052525051. The next prime is 5005052525087. The reversal of 5005052525055 is 5505252505005.
It is not a de Polignac number, because 5005052525055 - 22 = 5005052525051 is a prime.
It is a Smith number, since the sum of its digits (39) coincides with the sum of the digits of its prime factors.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (5005052525051) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (23) of ones.
It is a polite number, since it can be written in 47 ways as a sum of consecutive naturals, for example, 81075166 + ... + 81136875.
It is an arithmetic number, because the mean of its divisors is an integer number (194167814274).
Almost surely, 25005052525055 is an apocalyptic number.
5005052525055 is a gapful number since it is divisible by the number (55) formed by its first and last digit.
5005052525055 is a deficient number, since it is larger than the sum of its proper divisors (4315002560097).
5005052525055 is a wasteful number, since it uses less digits than its factorization.
5005052525055 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 162212088 (or 162212077 counting only the distinct ones).
The product of its (nonzero) digits is 312500, while the sum is 39.
The spelling of 5005052525055 in words is "five trillion, five billion, fifty-two million, five hundred twenty-five thousand, fifty-five".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.074 sec. • engine limits •