Base | Representation |
---|---|
bin | 10010111001000100… |
… | …10001110000100100 |
3 | 222011211202112021001 |
4 | 21130202101300210 |
5 | 131232430032400 |
6 | 4354231203044 |
7 | 506224116364 |
oct | 113442216044 |
9 | 28154675231 |
10 | 10142424100 |
11 | 4335152386 |
12 | 1b70816484 |
13 | c58365ca3 |
14 | 6c30389a4 |
15 | 3e5642a6a |
hex | 25c891c24 |
10142424100 has 18 divisors (see below), whose sum is σ = 22009060514. Its totient is φ = 4056969600.
The previous prime is 10142424091. The next prime is 10142424107. The reversal of 10142424100 is 142424101.
It can be written as a sum of positive squares in 3 ways, for example, as 1137173284 + 9005250816 = 33722^2 + 94896^2 .
It is not an unprimeable number, because it can be changed into a prime (10142424107) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (13) of ones.
It is a polite number, since it can be written in 5 ways as a sum of consecutive naturals, for example, 50712021 + ... + 50712220.
Almost surely, 210142424100 is an apocalyptic number.
10142424100 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
It is an amenable number.
10142424100 is an abundant number, since it is smaller than the sum of its proper divisors (11866636414).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
10142424100 is a wasteful number, since it uses less digits than its factorization.
10142424100 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 101424255 (or 101424248 counting only the distinct ones).
The product of its (nonzero) digits is 256, while the sum is 19.
Adding to 10142424100 its reverse (142424101), we get a palindrome (10284848201).
Subtracting from 10142424100 its reverse (142424101), we obtain a palindrome (9999999999).
The spelling of 10142424100 in words is "ten billion, one hundred forty-two million, four hundred twenty-four thousand, one hundred".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •