Base | Representation |
---|---|
bin | 11001001111011010000111… |
… | …10101101001111010101000 |
3 | 21021112020002220211002002110 |
4 | 30213231003311221322220 |
5 | 24233343220112130000 |
6 | 314014351211202320 |
7 | 14456050440562464 |
oct | 1447550365517250 |
9 | 237466086732073 |
10 | 55505000505000 |
11 | 1675a5a1855502 |
12 | 62852a84463a0 |
13 | 24c813990c6b7 |
14 | d9c6563674a4 |
15 | 663c2beba850 |
hex | 327b43d69ea8 |
55505000505000 has 80 divisors (see below), whose sum is σ = 173397621624480. Its totient is φ = 14801333464000.
The previous prime is 55505000504977. The next prime is 55505000505013. The reversal of 55505000505000 is 50500050555.
It is a Harshad number since it is a multiple of its sum of digits (30).
It is a super Niven number, because it is divisible the sum of any subset of its (nonzero) digits.
It is an unprimeable number.
It is a polite number, since it can be written in 19 ways as a sum of consecutive naturals, for example, 1850151684 + ... + 1850181683.
It is an arithmetic number, because the mean of its divisors is an integer number (2167470270306).
Almost surely, 255505000505000 is an apocalyptic number.
55505000505000 is a gapful number since it is divisible by the number (50) formed by its first and last digit.
It is an amenable number.
55505000505000 is an abundant number, since it is smaller than the sum of its proper divisors (117892621119480).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
55505000505000 is a wasteful number, since it uses less digits than its factorization.
55505000505000 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 3700333396 (or 3700333377 counting only the distinct ones).
The product of its (nonzero) digits is 15625, while the sum is 30.
Adding to 55505000505000 its reverse (50500050555), we get a palindrome (55555500555555).
The spelling of 55505000505000 in words is "fifty-five trillion, five hundred five billion, five hundred five thousand".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.076 sec. • engine limits •