Base | Representation |
---|---|
bin | 100100110010001011001… |
… | …0010110111010000010101 |
3 | 122220022021000021111200021 |
4 | 1021210112102313100111 |
5 | 1130312231420113221 |
6 | 14430253213345141 |
7 | 1031152153440403 |
oct | 111442622672025 |
9 | 18808230244607 |
10 | 5055550551061 |
11 | 167a05754079a |
12 | 6979717981b1 |
13 | 2a8975a66b1a |
14 | 13699332c473 |
15 | 8b78e51e041 |
hex | 499164b7415 |
5055550551061 has 8 divisors (see below), whose sum is σ = 5354004204864. Its totient is φ = 4757215600320.
The previous prime is 5055550551053. The next prime is 5055550551083. The reversal of 5055550551061 is 1601550555505.
It is a sphenic number, since it is the product of 3 distinct primes.
It is a cyclic number.
It is not a de Polignac number, because 5055550551061 - 23 = 5055550551053 is a prime.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 5055550550999 and 5055550551017.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (5055550551011) by changing a digit.
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 7 ways as a sum of consecutive naturals, for example, 29588065 + ... + 29758438.
It is an arithmetic number, because the mean of its divisors is an integer number (669250525608).
Almost surely, 25055550551061 is an apocalyptic number.
It is an amenable number.
5055550551061 is a deficient number, since it is larger than the sum of its proper divisors (298453653803).
5055550551061 is a wasteful number, since it uses less digits than its factorization.
5055550551061 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 59351531.
The product of its (nonzero) digits is 468750, while the sum is 43.
The spelling of 5055550551061 in words is "five trillion, fifty-five billion, five hundred fifty million, five hundred fifty-one thousand, sixty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •