Base | Representation |
---|---|
bin | 110000111001001111… |
… | …1011010001000000000 |
3 | 101001000122010021001012 |
4 | 1201302133122020000 |
5 | 3210020003114300 |
6 | 120123015300052 |
7 | 10404666465152 |
oct | 1416237321000 |
9 | 331018107035 |
10 | 105000051200 |
11 | 40591878620 |
12 | 1842437a628 |
13 | 9b94688715 |
14 | 5121136ad2 |
15 | 2ae81a1435 |
hex | 18727da200 |
105000051200 has 240 divisors, whose sum is σ = 300496150944. Its totient is φ = 35935027200.
The previous prime is 105000051199. The next prime is 105000051203. The reversal of 105000051200 is 2150000501.
It is a super-2 number, since 2×1050000512002 (a number of 23 digits) contains 22 as substring.
It is not an unprimeable number, because it can be changed into a prime (105000051203) by changing a digit.
It is a polite number, since it can be written in 23 ways as a sum of consecutive naturals, for example, 2371667 + ... + 2415533.
Almost surely, 2105000051200 is an apocalyptic number.
105000051200 is a gapful number since it is divisible by the number (10) 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 105000051200, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (150248075472).
105000051200 is an abundant number, since it is smaller than the sum of its proper divisors (195496099744).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
105000051200 is a wasteful number, since it uses less digits than its factorization.
105000051200 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 43923 (or 43902 counting only the distinct ones).
The product of its (nonzero) digits is 50, while the sum is 14.
Adding to 105000051200 its reverse (2150000501), we get a palindrome (107150051701).
The spelling of 105000051200 in words is "one hundred five billion, fifty-one thousand, two hundred".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •