Base | Representation |
---|---|
bin | 10011101001011100… |
… | …01100011010001110 |
3 | 1000020010022010122220 |
4 | 21310232030122032 |
5 | 133100314413402 |
6 | 4502404320210 |
7 | 522252141615 |
oct | 116456143216 |
9 | 30203263586 |
10 | 10548201102 |
11 | 452320367a |
12 | 20646a3066 |
13 | cc144ac1a |
14 | 720ca487c |
15 | 41b097dbc |
hex | 274b8c68e |
10548201102 has 32 divisors (see below), whose sum is σ = 21160998144. Its totient is φ = 3505320000.
The previous prime is 10548201067. The next prime is 10548201109. The reversal of 10548201102 is 20110284501.
10548201102 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-5 number, since 5×105482011025 (a number of 51 digits) contains 55555 as substring. Note that it is a super-d number also for d = 2.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (10548201109) 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, 3242977 + ... + 3246227.
It is an arithmetic number, because the mean of its divisors is an integer number (661281192).
Almost surely, 210548201102 is an apocalyptic number.
10548201102 is an abundant number, since it is smaller than the sum of its proper divisors (10612797042).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
10548201102 is a wasteful number, since it uses less digits than its factorization.
10548201102 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 4744.
The product of its (nonzero) digits is 640, while the sum is 24.
Adding to 10548201102 its reverse (20110284501), we get a palindrome (30658485603).
The spelling of 10548201102 in words is "ten billion, five hundred forty-eight million, two hundred one thousand, one hundred two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.063 sec. • engine limits •