Base | Representation |
---|---|
bin | 10010101000011111… |
… | …00010000000000001 |
3 | 221211010221220010021 |
4 | 21110033202000001 |
5 | 130441320322121 |
6 | 4332341133441 |
7 | 502614403042 |
oct | 112417420001 |
9 | 27733856107 |
10 | 10003292161 |
11 | 4273663505 |
12 | 1b320ba281 |
13 | c355a0ab5 |
14 | 6ac77c8c9 |
15 | 3d830d641 |
hex | 2543e2001 |
10003292161 has 12 divisors (see below), whose sum is σ = 10429789500. Its totient is φ = 9593409728.
The previous prime is 10003292153. The next prime is 10003292183. The reversal of 10003292161 is 16129230001.
It can be written as a sum of positive squares in 6 ways, for example, as 238887936 + 9764404225 = 15456^2 + 98815^2 .
It is not a de Polignac number, because 10003292161 - 23 = 10003292153 is a prime.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (10003292191) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (11) of ones.
It is a polite number, since it can be written in 11 ways as a sum of consecutive naturals, for example, 85395 + ... + 165223.
It is an arithmetic number, because the mean of its divisors is an integer number (869149125).
Almost surely, 210003292161 is an apocalyptic number.
It is an amenable number.
10003292161 is a deficient number, since it is larger than the sum of its proper divisors (426497339).
10003292161 is an equidigital number, since it uses as much as digits as its factorization.
10003292161 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 80036 (or 80007 counting only the distinct ones).
The product of its (nonzero) digits is 648, while the sum is 25.
The spelling of 10003292161 in words is "ten billion, three million, two hundred ninety-two thousand, one hundred sixty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.078 sec. • engine limits •