Base | Representation |
---|---|
bin | 10010101110000111… |
… | …00111100111101100 |
3 | 221221102210100121111 |
4 | 21113003213213230 |
5 | 131040412013400 |
6 | 4341145041404 |
7 | 504026564323 |
oct | 112703474754 |
9 | 27842710544 |
10 | 10050501100 |
11 | 4298278262 |
12 | 1b45a86264 |
13 | c422bc993 |
14 | 6b4b4b0ba |
15 | 3dc5363ba |
hex | 2570e79ec |
10050501100 has 18 divisors (see below), whose sum is σ = 21809587604. Its totient is φ = 4020200400.
The previous prime is 10050501091. The next prime is 10050501101. The reversal of 10050501100 is 110505001.
It is a super-2 number, since 2×100505011002 (a number of 21 digits) contains 22 as substring.
It is not an unprimeable number, because it can be changed into a prime (10050501101) by changing a digit.
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 5 ways as a sum of consecutive naturals, for example, 50252406 + ... + 50252605.
Almost surely, 210050501100 is an apocalyptic number.
10050501100 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
It is an amenable number.
10050501100 is an abundant number, since it is smaller than the sum of its proper divisors (11759086504).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
10050501100 is a wasteful number, since it uses less digits than its factorization.
10050501100 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 100505025 (or 100505018 counting only the distinct ones).
The product of its (nonzero) digits is 25, while the sum is 13.
The spelling of 10050501100 in words is "ten billion, fifty million, five hundred one thousand, one hundred".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.082 sec. • engine limits •