Base | Representation |
---|---|
bin | 10011101010001100… |
… | …11001011110000110 |
3 | 1000020120020111022010 |
4 | 21311012121132012 |
5 | 133103430433204 |
6 | 4503152315050 |
7 | 522360106203 |
oct | 116506313606 |
9 | 30216214263 |
10 | 10554546054 |
11 | 4526847738 |
12 | 2066842a86 |
13 | cc285cc30 |
14 | 721a76caa |
15 | 41b8ecd89 |
hex | 275199786 |
10554546054 has 32 divisors (see below), whose sum is σ = 22896437760. Its totient is φ = 3224185632.
The previous prime is 10554546053. The next prime is 10554546059. The reversal of 10554546054 is 45064545501.
10554546054 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is a super-3 number, since 3×105545460543 (a number of 31 digits) contains 333 as substring. Note that it is a super-d number also for d = 2.
It is a Harshad number since it is a multiple of its sum of digits (39).
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (10554546053) 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 15 ways as a sum of consecutive naturals, for example, 475902 + ... + 497585.
It is an arithmetic number, because the mean of its divisors is an integer number (715513680).
Almost surely, 210554546054 is an apocalyptic number.
10554546054 is an abundant number, since it is smaller than the sum of its proper divisors (12341891706).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
10554546054 is a wasteful number, since it uses less digits than its factorization.
10554546054 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 973644.
The product of its (nonzero) digits is 240000, while the sum is 39.
The spelling of 10554546054 in words is "ten billion, five hundred fifty-four million, five hundred forty-six thousand, fifty-four".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •