Base | Representation |
---|---|
bin | 10011101001111011… |
… | …00000011001011111 |
3 | 1000020101212001212210 |
4 | 21310331200121133 |
5 | 133102331341020 |
6 | 4503030331503 |
7 | 522331230420 |
oct | 116475403137 |
9 | 30211761783 |
10 | 10552215135 |
11 | 45254a5460 |
12 | 2065ab9b93 |
13 | cc2224ca7 |
14 | 72162b647 |
15 | 41b5dc3e0 |
hex | 274f6065f |
10552215135 has 64 divisors (see below), whose sum is σ = 21286333440. Its totient is φ = 4336020480.
The previous prime is 10552215101. The next prime is 10552215161. The reversal of 10552215135 is 53151225501.
It is not a de Polignac number, because 10552215135 - 28 = 10552214879 is a prime.
It is a super-2 number, since 2×105522151352 (a number of 21 digits) contains 22 as substring.
It is a congruent number.
It is an unprimeable number.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written in 63 ways as a sum of consecutive naturals, for example, 51469 + ... + 154121.
It is an arithmetic number, because the mean of its divisors is an integer number (332598960).
Almost surely, 210552215135 is an apocalyptic number.
10552215135 is a gapful number since it is divisible by the number (15) formed by its first and last digit.
10552215135 is an abundant number, since it is smaller than the sum of its proper divisors (10734118305).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
10552215135 is a wasteful number, since it uses less digits than its factorization.
10552215135 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 102768.
The product of its (nonzero) digits is 7500, while the sum is 30.
The spelling of 10552215135 in words is "ten billion, five hundred fifty-two million, two hundred fifteen thousand, one hundred thirty-five".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •