Base | Representation |
---|---|
bin | 10011110101111111… |
… | …01100101100110000 |
3 | 1000111110100111021012 |
4 | 21322333230230300 |
5 | 133304240444404 |
6 | 4521044250052 |
7 | 525000600020 |
oct | 117277545460 |
9 | 30443314235 |
10 | 10653453104 |
11 | 4577661aa8 |
12 | 20939a0928 |
13 | 100a1b0108 |
14 | 730c61a80 |
15 | 425438a6e |
hex | 27afecb30 |
10653453104 has 80 divisors (see below), whose sum is σ = 25131391488. Its totient is φ = 4270703616.
The previous prime is 10653453101. The next prime is 10653453157. The reversal of 10653453104 is 40135435601.
It is a super-2 number, since 2×106534531042 (a number of 21 digits) contains 22 as substring.
It is not an unprimeable number, because it can be changed into a prime (10653453101) by changing a digit.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 293189 + ... + 327515.
Almost surely, 210653453104 is an apocalyptic number.
10653453104 is a gapful number since it is divisible by the number (14) formed by its first and last digit.
It is an amenable number.
It is a practical number, because each smaller number is the sum of distinct divisors of 10653453104, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (12565695744).
10653453104 is an abundant number, since it is smaller than the sum of its proper divisors (14477938384).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
10653453104 is a wasteful number, since it uses less digits than its factorization.
10653453104 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 34522 (or 34516 counting only the distinct ones).
The product of its (nonzero) digits is 21600, while the sum is 32.
Adding to 10653453104 its reverse (40135435601), we get a palindrome (50788888705).
The spelling of 10653453104 in words is "ten billion, six hundred fifty-three million, four hundred fifty-three thousand, one hundred four".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •