Base | Representation |
---|---|
bin | 10000001001111101101… |
… | …01110000100010111001 |
3 | 1222001211020002212002112 |
4 | 20010332311300202321 |
5 | 33043323343423144 |
6 | 1103002311542105 |
7 | 55051010111120 |
oct | 10047665604271 |
9 | 1861736085075 |
10 | 555105061049 |
11 | 1a4467376470 |
12 | 8b6bb68a935 |
13 | 40466742686 |
14 | 1cc1d962ab7 |
15 | e68d78399e |
hex | 813ed708b9 |
555105061049 has 8 divisors (see below), whose sum is σ = 692079037248. Its totient is φ = 432549398160.
The previous prime is 555105061039. The next prime is 555105061051. The reversal of 555105061049 is 940160501555.
It is a sphenic number, since it is the product of 3 distinct primes.
It is not a de Polignac number, because 555105061049 - 28 = 555105060793 is a prime.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 555105060997 and 555105061015.
It is not an unprimeable number, because it can be changed into a prime (555105061039) 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, 3604578242 + ... + 3604578395.
It is an arithmetic number, because the mean of its divisors is an integer number (86509879656).
Almost surely, 2555105061049 is an apocalyptic number.
It is an amenable number.
555105061049 is a deficient number, since it is larger than the sum of its proper divisors (136973976199).
555105061049 is a wasteful number, since it uses less digits than its factorization.
555105061049 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 7209156655.
The product of its (nonzero) digits is 135000, while the sum is 41.
It can be divided in two parts, 55510506 and 1049, that added together give a palindrome (55511555).
The spelling of 555105061049 in words is "five hundred fifty-five billion, one hundred five million, sixty-one thousand, forty-nine".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •