Base | Representation |
---|---|
bin | 10011000000101110… |
… | …11110011111000001 |
3 | 222100022201011021200 |
4 | 21200113132133001 |
5 | 131400403422010 |
6 | 4404445011413 |
7 | 510634350150 |
oct | 114027363701 |
9 | 28308634250 |
10 | 10206701505 |
11 | 4368464a00 |
12 | 1b8a253b69 |
13 | c6877cb60 |
14 | 6cb7ab597 |
15 | 3eb0dccc0 |
hex | 2605de7c1 |
10206701505 has 144 divisors (see below), whose sum is σ = 23934892800. Its totient is φ = 3915267840.
The previous prime is 10206701501. The next prime is 10206701507. The reversal of 10206701505 is 50510760201.
10206701505 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is not a de Polignac number, because 10206701505 - 22 = 10206701501 is a prime.
It is a super-2 number, since 2×102067015052 (a number of 21 digits) contains 22 as substring.
It is not an unprimeable number, because it can be changed into a prime (10206701501) by changing a digit.
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 in 143 ways as a sum of consecutive naturals, for example, 485196 + ... + 505794.
Almost surely, 210206701505 is an apocalyptic number.
10206701505 is a gapful number since it is divisible by the number (15) formed by its first and last digit.
It is an amenable number.
10206701505 is an abundant number, since it is smaller than the sum of its proper divisors (13728191295).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
10206701505 is a wasteful number, since it uses less digits than its factorization.
10206701505 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 20652 (or 20638 counting only the distinct ones).
The product of its (nonzero) digits is 2100, while the sum is 27.
The spelling of 10206701505 in words is "ten billion, two hundred six million, seven hundred one thousand, five hundred five".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •