Base | Representation |
---|---|
bin | 10000001001010001000… |
… | …01010101011011011110 |
3 | 1222000212010111200120001 |
4 | 20010220201111123132 |
5 | 33042042013431400 |
6 | 1102501214044514 |
7 | 55035512241232 |
oct | 10045041253336 |
9 | 1860763450501 |
10 | 554730608350 |
11 | 1a4294a6a626 |
12 | 8b6161a973a |
13 | 40406ca7429 |
14 | 1cbc5d2c5c2 |
15 | e66a969a6a |
hex | 81288556de |
554730608350 has 12 divisors (see below), whose sum is σ = 1031798931624. Its totient is φ = 221892243320.
The previous prime is 554730608297. The next prime is 554730608357. The reversal of 554730608350 is 53806037455.
It is a super-2 number, since 2×5547306083502 (a number of 24 digits) contains 22 as substring.
It is a self number, because there is not a number n which added to its sum of digits gives 554730608350.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (554730608357) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (17) of ones.
It is a polite number, since it can be written in 5 ways as a sum of consecutive naturals, for example, 5547306034 + ... + 5547306133.
It is an arithmetic number, because the mean of its divisors is an integer number (85983244302).
Almost surely, 2554730608350 is an apocalyptic number.
554730608350 is a gapful number since it is divisible by the number (50) formed by its first and last digit.
554730608350 is a deficient number, since it is larger than the sum of its proper divisors (477068323274).
554730608350 is a wasteful number, since it uses less digits than its factorization.
554730608350 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 11094612179 (or 11094612174 counting only the distinct ones).
The product of its (nonzero) digits is 1512000, while the sum is 46.
The spelling of 554730608350 in words is "five hundred fifty-four billion, seven hundred thirty million, six hundred eight thousand, three hundred fifty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.074 sec. • engine limits •