Base | Representation |
---|---|
bin | 10010111010000110… |
… | …11110010111101001 |
3 | 222012110010122201100 |
4 | 21131003132113221 |
5 | 131242142022010 |
6 | 4355141512013 |
7 | 506361103002 |
oct | 113503362751 |
9 | 28173118640 |
10 | 10151126505 |
11 | 433a056653 |
12 | 1b73712609 |
13 | c5a0c2040 |
14 | 6c42621a9 |
15 | 3e62b12c0 |
hex | 25d0de5e9 |
10151126505 has 144 divisors (see below), whose sum is σ = 20087907840. Its totient is φ = 4711730688.
The previous prime is 10151126473. The next prime is 10151126539. The reversal of 10151126505 is 50562115101.
10151126505 is a `hidden beast` number, since 1 + 0 + 1 + 5 + 1 + 1 + 2 + 650 + 5 = 666.
10151126505 is digitally balanced in base 3, because in such base it contains all the possibile digits an equal number of times.
It is not a de Polignac number, because 10151126505 - 25 = 10151126473 is a prime.
It is a Curzon number.
It is an unprimeable number.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written in 143 ways as a sum of consecutive naturals, for example, 23123076 + ... + 23123514.
It is an arithmetic number, because the mean of its divisors is an integer number (139499360).
Almost surely, 210151126505 is an apocalyptic number.
10151126505 is a gapful number since it is divisible by the number (15) formed by its first and last digit.
It is an amenable number.
10151126505 is a deficient number, since it is larger than the sum of its proper divisors (9936781335).
10151126505 is a wasteful number, since it uses less digits than its factorization.
10151126505 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 568 (or 536 counting only the distinct ones).
The product of its (nonzero) digits is 1500, while the sum is 27.
The spelling of 10151126505 in words is "ten billion, one hundred fifty-one million, one hundred twenty-six thousand, five hundred five".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.088 sec. • engine limits •