Base | Representation |
---|---|
bin | 1001011010100110… |
… | …10101010100110100 |
3 | 111001021220010020022 |
4 | 10231103111110310 |
5 | 40323040310400 |
6 | 2153334224312 |
7 | 236160606530 |
oct | 45523252464 |
9 | 14037803208 |
10 | 5055010100 |
11 | 216446a9a8 |
12 | b90ab5098 |
13 | 62737c54a |
14 | 35d500bc0 |
15 | 1e8bc0b85 |
hex | 12d4d5534 |
5055010100 has 72 divisors (see below), whose sum is σ = 12585652800. Its totient is φ = 1726341120.
The previous prime is 5055010099. The next prime is 5055010111. The reversal of 5055010100 is 10105505.
It is a super-2 number, since 2×50550101002 = 51106254222204020000, which contains 22 as substring.
It is a congruent number.
It is an unprimeable number.
It is a polite number, since it can be written in 23 ways as a sum of consecutive naturals, for example, 165851 + ... + 193949.
Almost surely, 25055010100 is an apocalyptic number.
5055010100 is a gapful number since it is divisible by the number (50) formed by its first and last digit.
It is an amenable number.
It is a practical number, because each smaller number is the sum of distinct divisors of 5055010100, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (6292826400).
5055010100 is an abundant number, since it is smaller than the sum of its proper divisors (7530642700).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
5055010100 is a wasteful number, since it uses less digits than its factorization.
5055010100 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 28377 (or 28370 counting only the distinct ones).
The product of its (nonzero) digits is 125, while the sum is 17.
The square root of 5055010100 is about 71098.5942195765. The cubic root of 5055010100 is about 1716.2241512912.
Adding to 5055010100 its reverse (10105505), we get a palindrome (5065115605).
The spelling of 5055010100 in words is "five billion, fifty-five million, ten thousand, one hundred".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.066 sec. • engine limits •