Base | Representation |
---|---|
bin | 10010111010000011… |
… | …00111110111110100 |
3 | 222012102012222220212 |
4 | 21131001213313310 |
5 | 131242031004030 |
6 | 4355123244552 |
7 | 506354011643 |
oct | 113501476764 |
9 | 28172188825 |
10 | 10150641140 |
11 | 4339854a22 |
12 | 1b73519758 |
13 | c59c82143 |
14 | 6c417735a |
15 | 3e6217595 |
hex | 25d067df4 |
10150641140 has 24 divisors (see below), whose sum is σ = 21325195752. Its totient is φ = 4058570880.
The previous prime is 10150641131. The next prime is 10150641173. The reversal of 10150641140 is 4114605101.
It is a happy number.
It can be written as a sum of positive squares in 4 ways, for example, as 3721488016 + 6429153124 = 61004^2 + 80182^2 .
It is a congruent 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 7 ways as a sum of consecutive naturals, for example, 55391 + ... + 152870.
It is an arithmetic number, because the mean of its divisors is an integer number (888549823).
Almost surely, 210150641140 is an apocalyptic number.
10150641140 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
It is an amenable number.
10150641140 is an abundant number, since it is smaller than the sum of its proper divisors (11174554612).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
10150641140 is a wasteful number, since it uses less digits than its factorization.
10150641140 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 210707 (or 210705 counting only the distinct ones).
The product of its (nonzero) digits is 480, while the sum is 23.
The spelling of 10150641140 in words is "ten billion, one hundred fifty million, six hundred forty-one thousand, one hundred forty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.085 sec. • engine limits •