Base | Representation |
---|---|
bin | 10011110110001111… |
… | …00101100001001010 |
3 | 1000111121020112200002 |
4 | 21323013211201022 |
5 | 133310303131332 |
6 | 4521200443002 |
7 | 525024301301 |
oct | 117307454112 |
9 | 30447215602 |
10 | 10655520842 |
11 | 457884457a |
12 | 2094619462 |
13 | 100a755325 |
14 | 73123d438 |
15 | 4256e6562 |
hex | 27b1e584a |
10655520842 has 4 divisors (see below), whose sum is σ = 15983281266. Its totient is φ = 5327760420.
The previous prime is 10655520833. The next prime is 10655520851. The reversal of 10655520842 is 24802555601.
10655520842 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is a semiprime because it is the product of two primes.
It is an interprime number because it is at equal distance from previous prime (10655520833) and next prime (10655520851).
It can be written as a sum of positive squares in only one way, i.e., 7368677281 + 3286843561 = 85841^2 + 57331^2 .
It is a super-2 number, since 2×106555208422 (a number of 21 digits) contains 22 as substring.
It is a junction number, because it is equal to n+sod(n) for n = 10655520796 and 10655520805.
It is an unprimeable number.
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 as a sum of consecutive naturals, namely, 2663880209 + ... + 2663880212.
Almost surely, 210655520842 is an apocalyptic number.
10655520842 is a deficient number, since it is larger than the sum of its proper divisors (5327760424).
10655520842 is an equidigital number, since it uses as much as digits as its factorization.
10655520842 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 5327760423.
The product of its (nonzero) digits is 96000, while the sum is 38.
The spelling of 10655520842 in words is "ten billion, six hundred fifty-five million, five hundred twenty thousand, eight hundred forty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.067 sec. • engine limits •