Base | Representation |
---|---|
bin | 10010101000011000… |
… | …01010011011110111 |
3 | 221211002022000221021 |
4 | 21110030022123313 |
5 | 130441104043312 |
6 | 4332310202011 |
7 | 502604034610 |
oct | 112414123367 |
9 | 27732260837 |
10 | 10002409207 |
11 | 427311009a |
12 | 1b31953307 |
13 | c35351c3b |
14 | 6ac5ccc07 |
15 | 3d81d6c07 |
hex | 25430a6f7 |
10002409207 has 18 divisors (see below), whose sum is σ = 11574925128. Its totient is φ = 8467121592.
The previous prime is 10002409177. The next prime is 10002409243. The reversal of 10002409207 is 70290420001.
10002409207 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 10002409207 - 211 = 10002407159 is a prime.
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (10002409007) 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 17 ways as a sum of consecutive naturals, for example, 27254338 + ... + 27254704.
It is an arithmetic number, because the mean of its divisors is an integer number (643051396).
Almost surely, 210002409207 is an apocalyptic number.
10002409207 is a deficient number, since it is larger than the sum of its proper divisors (1572515921).
10002409207 is an frugal number, since it uses more digits than its factorization.
10002409207 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 947 (or 477 counting only the distinct ones).
The product of its (nonzero) digits is 1008, while the sum is 25.
Multiplying 10002409207 by its product of nonzero digits (1008), we get a square (10082428480656 = 31752842).
Adding to 10002409207 its reverse (70290420001), we get a palindrome (80292829208).
The spelling of 10002409207 in words is "ten billion, two million, four hundred nine thousand, two hundred seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.079 sec. • engine limits •