Base | Representation |
---|---|
bin | 10010101000101101… |
… | …10110100110110001 |
3 | 221211021120102001110 |
4 | 21110112312212301 |
5 | 130442313232234 |
6 | 4332450223533 |
7 | 502636616013 |
oct | 112426664661 |
9 | 27737512043 |
10 | 10005211569 |
11 | 42747545a1 |
12 | 1b32884ba9 |
13 | c35ac3642 |
14 | 6acb1c1b3 |
15 | 3d858c1e9 |
hex | 2545b69b1 |
10005211569 has 16 divisors (see below), whose sum is σ = 14139021312. Its totient is φ = 6271550208.
The previous prime is 10005211553. The next prime is 10005211609. The reversal of 10005211569 is 96511250001.
10005211569 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 10005211569 - 24 = 10005211553 is a prime.
It is a super-2 number, since 2×100052115692 (a number of 21 digits) contains 22 as substring.
It is not an unprimeable number, because it can be changed into a prime (10005211549) 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 15 ways as a sum of consecutive naturals, for example, 45169 + ... + 148494.
It is an arithmetic number, because the mean of its divisors is an integer number (883688832).
Almost surely, 210005211569 is an apocalyptic number.
It is an amenable number.
10005211569 is a deficient number, since it is larger than the sum of its proper divisors (4133809743).
10005211569 is a wasteful number, since it uses less digits than its factorization.
10005211569 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 194696.
The product of its (nonzero) digits is 2700, while the sum is 30.
The spelling of 10005211569 in words is "ten billion, five million, two hundred eleven thousand, five hundred sixty-nine".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.075 sec. • engine limits •