Base | Representation |
---|---|
bin | 10010101001110010… |
… | …11001010010011101 |
3 | 221211220121110010012 |
4 | 21110321121102131 |
5 | 131002123012100 |
6 | 4333412253005 |
7 | 503106601214 |
oct | 112471312235 |
9 | 27756543105 |
10 | 10014266525 |
11 | 427987972a |
12 | 1b35911165 |
13 | c37943cc3 |
14 | 6addd807b |
15 | 3d927a135 |
hex | 254e5949d |
10014266525 has 12 divisors (see below), whose sum is σ = 12651988212. Its totient is φ = 7860253440.
The previous prime is 10014266513. The next prime is 10014266533. The reversal of 10014266525 is 52566241001.
10014266525 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It can be written as a sum of positive squares in 6 ways, for example, as 133310116 + 9880956409 = 11546^2 + 99403^2 .
It is not a de Polignac number, because 10014266525 - 26 = 10014266461 is a prime.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 10014266491 and 10014266500.
It is a congruent number.
It is an unprimeable number.
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 11 ways as a sum of consecutive naturals, for example, 3777644 + ... + 3780293.
It is an arithmetic number, because the mean of its divisors is an integer number (1054332351).
Almost surely, 210014266525 is an apocalyptic number.
It is an amenable number.
10014266525 is a deficient number, since it is larger than the sum of its proper divisors (2637721687).
10014266525 is an equidigital number, since it uses as much as digits as its factorization.
10014266525 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 7558000 (or 7557995 counting only the distinct ones).
The product of its (nonzero) digits is 14400, while the sum is 32.
The spelling of 10014266525 in words is "ten billion, fourteen million, two hundred sixty-six thousand, five hundred twenty-five".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.074 sec. • engine limits •