Base | Representation |
---|---|
bin | 10011101001011011… |
… | …00000001110001010 |
3 | 1000020002221221101100 |
4 | 21310231200032022 |
5 | 133100243120411 |
6 | 4502400402230 |
7 | 522250456131 |
oct | 116455401612 |
9 | 30202857340 |
10 | 10548020106 |
11 | 452309a698 |
12 | 2064616376 |
13 | cc13b6720 |
14 | 720c58918 |
15 | 41b05e456 |
hex | 274b6038a |
10548020106 has 24 divisors (see below), whose sum is σ = 24612047460. Its totient is φ = 3245544576.
The previous prime is 10548020101. The next prime is 10548020111. The reversal of 10548020106 is 60102084501.
10548020106 is a `hidden beast` number, since 10 + 548 + 0 + 2 + 0 + 106 = 666.
It is an interprime number because it is at equal distance from previous prime (10548020101) and next prime (10548020111).
It can be written as a sum of positive squares in 2 ways, for example, as 8233929081 + 2314091025 = 90741^2 + 48105^2 .
It is a super-2 number, since 2×105480201062 (a number of 21 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 10548020106.
It is not an unprimeable number, because it can be changed into a prime (10548020101) by changing a digit.
It is a polite number, since it can be written in 11 ways as a sum of consecutive naturals, for example, 22538271 + ... + 22538738.
Almost surely, 210548020106 is an apocalyptic number.
10548020106 is an abundant number, since it is smaller than the sum of its proper divisors (14064027354).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
10548020106 is a wasteful number, since it uses less digits than its factorization.
10548020106 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 45077030 (or 45077027 counting only the distinct ones).
The product of its (nonzero) digits is 1920, while the sum is 27.
The spelling of 10548020106 in words is "ten billion, five hundred forty-eight million, twenty thousand, one hundred six".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.078 sec. • engine limits •