Base | Representation |
---|---|
bin | 10011101011000101… |
… | …11011001010111001 |
3 | 1000021002022102021120 |
4 | 21311202323022321 |
5 | 133112334232441 |
6 | 4504020455453 |
7 | 522510503145 |
oct | 116542731271 |
9 | 30232272246 |
10 | 10562024121 |
11 | 452aa95060 |
12 | 206924a589 |
13 | cc427a91c |
14 | 722a62225 |
15 | 41c3c8966 |
hex | 2758bb2b9 |
10562024121 has 8 divisors (see below), whose sum is σ = 15362944224. Its totient is φ = 6401226720.
The previous prime is 10562024087. The next prime is 10562024131. The reversal of 10562024121 is 12142026501.
It is a sphenic number, since it is the product of 3 distinct primes.
It is not a de Polignac number, because 10562024121 - 213 = 10562015929 is a prime.
It is a super-2 number, since 2×105620241212 (a number of 21 digits) contains 22 as substring.
It is a junction number, because it is equal to n+sod(n) for n = 10562024091 and 10562024100.
It is not an unprimeable number, because it can be changed into a prime (10562024131) by changing a digit.
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 7 ways as a sum of consecutive naturals, for example, 160030636 + ... + 160030701.
It is an arithmetic number, because the mean of its divisors is an integer number (1920368028).
Almost surely, 210562024121 is an apocalyptic number.
10562024121 is a gapful number since it is divisible by the number (11) formed by its first and last digit.
It is an amenable number.
10562024121 is a deficient number, since it is larger than the sum of its proper divisors (4800920103).
10562024121 is a wasteful number, since it uses less digits than its factorization.
10562024121 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 320061351.
The product of its (nonzero) digits is 960, while the sum is 24.
The spelling of 10562024121 in words is "ten billion, five hundred sixty-two million, twenty-four thousand, one hundred twenty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •