Base | Representation |
---|---|
bin | 110000111010110010… |
… | …1100100111100000000 |
3 | 101001011020212112101211 |
4 | 1201311211210330000 |
5 | 3210121303000000 |
6 | 120132112535504 |
7 | 10406200160323 |
oct | 1416545447400 |
9 | 331136775354 |
10 | 105052000000 |
11 | 4060912a512 |
12 | 18439851594 |
13 | 9ba2376b5c |
14 | 5127dba7ba |
15 | 2aeca137ba |
hex | 1875964f00 |
105052000000 has 126 divisors (see below), whose sum is σ = 262123676024. Its totient is φ = 42019200000.
The previous prime is 105051999977. The next prime is 105052000043. The reversal of 105052000000 is 250501.
It is a super-2 number, since 2×1050520000002 (a number of 23 digits) 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 13 ways as a sum of consecutive naturals, for example, 3986869 + ... + 4013131.
Almost surely, 2105052000000 is an apocalyptic number.
105052000000 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 105052000000, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (131061838012).
105052000000 is an abundant number, since it is smaller than the sum of its proper divisors (157071676024).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
105052000000 is an frugal number, since it uses more digits than its factorization.
105052000000 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 26309 (or 26270 counting only the distinct ones).
The product of its (nonzero) digits is 50, while the sum is 13.
Adding to 105052000000 its reverse (250501), we get a palindrome (105052250501).
The spelling of 105052000000 in words is "one hundred five billion, fifty-two million", and thus it is an aban number.
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •