Base | Representation |
---|---|
bin | 10011110000010000… |
… | …01111100101100001 |
3 | 1000101002212011222212 |
4 | 21320020033211201 |
5 | 133204433032010 |
6 | 4512205411505 |
7 | 523545041204 |
oct | 117010174541 |
9 | 30332764885 |
10 | 10605361505 |
11 | 45524a5082 |
12 | 207b869b95 |
13 | 100024254b |
14 | 72870393b |
15 | 4210d9505 |
hex | 27820f961 |
10605361505 has 4 divisors (see below), whose sum is σ = 12726433812. Its totient is φ = 8484289200.
The previous prime is 10605361471. The next prime is 10605361531. The reversal of 10605361505 is 50516350601.
It is a semiprime because it is the product of two primes.
It can be written as a sum of positive squares in 2 ways, for example, as 3049579729 + 7555781776 = 55223^2 + 86924^2 .
It is not a de Polignac number, because 10605361505 - 210 = 10605360481 is a prime.
It is a super-2 number, since 2×106053615052 (a number of 21 digits) contains 22 as substring.
It is a Duffinian number.
It is a Curzon number.
It is an unprimeable number.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 1060536146 + ... + 1060536155.
It is an arithmetic number, because the mean of its divisors is an integer number (3181608453).
Almost surely, 210605361505 is an apocalyptic number.
It is an amenable number.
10605361505 is a deficient number, since it is larger than the sum of its proper divisors (2121072307).
10605361505 is an equidigital number, since it uses as much as digits as its factorization.
10605361505 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 2121072306.
The product of its (nonzero) digits is 13500, while the sum is 32.
The spelling of 10605361505 in words is "ten billion, six hundred five million, three hundred sixty-one thousand, five hundred five".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •