Base | Representation |
---|---|
bin | 10011100101101001… |
… | …11101110101000001 |
3 | 1000010220111120212101 |
4 | 21302310331311001 |
5 | 133014201000303 |
6 | 4455311230401 |
7 | 521415053212 |
oct | 116264756501 |
9 | 30126446771 |
10 | 10516421953 |
11 | 4507278514 |
12 | 2055b18401 |
13 | cb79a21ab |
14 | 71a991409 |
15 | 4183bbd1d |
hex | 272d3dd41 |
10516421953 has 8 divisors (see below), whose sum is σ = 10612247688. Its totient is φ = 10420644864.
The previous prime is 10516421947. The next prime is 10516421959. The reversal of 10516421953 is 35912461501.
It is an interprime number because it is at equal distance from previous prime (10516421947) and next prime (10516421959).
It can be written as a sum of positive squares in 4 ways, for example, as 98545329 + 10417876624 = 9927^2 + 102068^2 .
It is a sphenic number, since it is the product of 3 distinct primes.
It is a cyclic number.
It is not a de Polignac number, because 10516421953 - 29 = 10516421441 is a prime.
It is a super-2 number, since 2×105164219532 (a number of 21 digits) contains 22 as substring.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (10516421959) 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, 531901 + ... + 551317.
It is an arithmetic number, because the mean of its divisors is an integer number (1326530961).
Almost surely, 210516421953 is an apocalyptic number.
It is an amenable number.
10516421953 is a deficient number, since it is larger than the sum of its proper divisors (95825735).
10516421953 is a wasteful number, since it uses less digits than its factorization.
10516421953 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 24323.
The product of its (nonzero) digits is 32400, while the sum is 37.
The spelling of 10516421953 in words is "ten billion, five hundred sixteen million, four hundred twenty-one thousand, nine hundred fifty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.081 sec. • engine limits •