Base | Representation |
---|---|
bin | 10011110110011100… |
… | …01100001010101001 |
3 | 1000111201111111101101 |
4 | 21323032030022221 |
5 | 133311224031014 |
6 | 4521301521401 |
7 | 525045101365 |
oct | 117316141251 |
9 | 30451444341 |
10 | 10657252009 |
11 | 4579817198 |
12 | 2095113261 |
13 | 100ac102a1 |
14 | 7315702a5 |
15 | 425939474 |
hex | 27b38c2a9 |
10657252009 has 8 divisors (see below), whose sum is σ = 11774764800. Its totient is φ = 9594252096.
The previous prime is 10657252003. The next prime is 10657252033. The reversal of 10657252009 is 90025275601.
10657252009 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
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 10657252009 - 227 = 10523034281 is a prime.
It is a super-2 number, since 2×106572520092 (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 (10657252003) 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 7 ways as a sum of consecutive naturals, for example, 13627809 + ... + 13628590.
It is an arithmetic number, because the mean of its divisors is an integer number (1471845600).
Almost surely, 210657252009 is an apocalyptic number.
It is an amenable number.
10657252009 is a deficient number, since it is larger than the sum of its proper divisors (1117512791).
10657252009 is a wasteful number, since it uses less digits than its factorization.
10657252009 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 27256439.
The product of its (nonzero) digits is 37800, while the sum is 37.
The spelling of 10657252009 in words is "ten billion, six hundred fifty-seven million, two hundred fifty-two thousand, nine".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.108 sec. • engine limits •