Base | Representation |
---|---|
bin | 10010111001011100… |
… | …01100111101001000 |
3 | 222012001122100101202 |
4 | 21130232030331020 |
5 | 131234230101102 |
6 | 4354422203332 |
7 | 506262516263 |
oct | 113456147510 |
9 | 28161570352 |
10 | 10145550152 |
11 | 4336997aa1 |
12 | 1b71883548 |
13 | c58bbbb1a |
14 | 6c360dcda |
15 | 3e5a5de02 |
hex | 25cb8cf48 |
10145550152 has 32 divisors (see below), whose sum is σ = 19270742400. Its totient is φ = 5006804544.
The previous prime is 10145550133. The next prime is 10145550167. The reversal of 10145550152 is 25105554101.
10145550152 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
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 7 ways as a sum of consecutive naturals, for example, 734849 + ... + 748527.
It is an arithmetic number, because the mean of its divisors is an integer number (602210700).
Almost surely, 210145550152 is an apocalyptic number.
It is an amenable number.
10145550152 is a deficient number, since it is larger than the sum of its proper divisors (9125192248).
10145550152 is a wasteful number, since it uses less digits than its factorization.
10145550152 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 14885 (or 14881 counting only the distinct ones).
The product of its (nonzero) digits is 5000, while the sum is 29.
The spelling of 10145550152 in words is "ten billion, one hundred forty-five million, five hundred fifty thousand, one hundred fifty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •