Base | Representation |
---|---|
bin | 111110110010001… |
… | …100010101010100 |
3 | 2201102001110211210 |
4 | 332302030111110 |
5 | 4124124020413 |
6 | 252304501420 |
7 | 35050166664 |
oct | 7662142524 |
9 | 2642043753 |
10 | 1053345108 |
11 | 4a0649852 |
12 | 25491a870 |
13 | 13a2c703a |
14 | 9dc761a4 |
15 | 6271c3c3 |
hex | 3ec8c554 |
1053345108 has 24 divisors (see below), whose sum is σ = 2504180448. Its totient is φ = 344490016.
The previous prime is 1053345103. The next prime is 1053345121. The reversal of 1053345108 is 8015433501.
1053345108 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-2 number, since 2×10533451082 = 2219071833095063328, which contains 22 as substring.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (1053345101) by changing a digit.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 827466 + ... + 828737.
It is an arithmetic number, because the mean of its divisors is an integer number (104340852).
Almost surely, 21053345108 is an apocalyptic number.
It is an amenable number.
1053345108 is an abundant number, since it is smaller than the sum of its proper divisors (1450835340).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
1053345108 is a wasteful number, since it uses less digits than its factorization.
1053345108 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1656263 (or 1656261 counting only the distinct ones).
The product of its (nonzero) digits is 7200, while the sum is 30.
The square root of 1053345108 is about 32455.2785845384. The cubic root of 1053345108 is about 1017.4745636134.
Adding to 1053345108 its reverse (8015433501), we get a palindrome (9068778609).
The spelling of 1053345108 in words is "one billion, fifty-three million, three hundred forty-five thousand, one hundred eight".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.065 sec. • engine limits •