Base | Representation |
---|---|
bin | 11001000011101000110001… |
… | …01111101101011100111010 |
3 | 21020002120011002222010201002 |
4 | 30201310120233231130322 |
5 | 24210231411423204011 |
6 | 313104502110125002 |
7 | 14414612003244125 |
oct | 1441643057553472 |
9 | 236076132863632 |
10 | 55100550600506 |
11 | 16614015388a94 |
12 | 621aa32ab0762 |
13 | 2498c623b7598 |
14 | d86c491b93bc |
15 | 658459acbc3b |
hex | 321d18bed73a |
55100550600506 has 8 divisors (see below), whose sum is σ = 87000869369280. Its totient is φ = 26100260810748.
The previous prime is 55100550600499. The next prime is 55100550600509. The reversal of 55100550600506 is 60500605500155.
It is a sphenic number, since it is the product of 3 distinct primes.
It is a Harshad number since it is a multiple of its sum of digits (38), and also a Moran number because the ratio is a prime number: 1450014489487 = 55100550600506 / (5 + 5 + 1 + 0 + 0 + 5 + 5 + 0 + 6 + 0 + 0 + 5 + 0 + 6).
It is a self number, because there is not a number n which added to its sum of digits gives 55100550600506.
It is not an unprimeable number, because it can be changed into a prime (55100550600509) by changing a digit.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 725007244706 + ... + 725007244781.
It is an arithmetic number, because the mean of its divisors is an integer number (10875108671160).
Almost surely, 255100550600506 is an apocalyptic number.
55100550600506 is a deficient number, since it is larger than the sum of its proper divisors (31900318768774).
55100550600506 is a wasteful number, since it uses less digits than its factorization.
55100550600506 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1450014489508.
The product of its (nonzero) digits is 112500, while the sum is 38.
The spelling of 55100550600506 in words is "fifty-five trillion, one hundred billion, five hundred fifty million, six hundred thousand, five hundred six".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.077 sec. • engine limits •