Base | Representation |
---|---|
bin | 110000111010111000… |
… | …1011010000001001000 |
3 | 101001011110201002011200 |
4 | 1201311301122001020 |
5 | 3210123101213000 |
6 | 120132303224200 |
7 | 10406235424203 |
oct | 1416561320110 |
9 | 331143632150 |
10 | 105055101000 |
11 | 4060a958323 |
12 | 1843a8a8060 |
13 | 9ba2bc1475 |
14 | 512858693a |
15 | 2aece27500 |
hex | 1875c5a048 |
105055101000 has 96 divisors (see below), whose sum is σ = 355086271800. Its totient is φ = 28014691200.
The previous prime is 105055100993. The next prime is 105055101013. The reversal of 105055101000 is 101550501.
105055101000 is a `hidden beast` number, since 1 + 0 + 50 + 5 + 510 + 100 + 0 = 666.
It can be written as a sum of positive squares in 4 ways, for example, as 48427283844 + 56627817156 = 220062^2 + 237966^2 .
It is a super-2 number, since 2×1050551010002 (a number of 23 digits) contains 22 as substring.
It is a Harshad number since it is a multiple of its sum of digits (18).
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, 5827395 + ... + 5845394.
Almost surely, 2105055101000 is an apocalyptic number.
105055101000 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
It is an amenable number.
105055101000 is an abundant number, since it is smaller than the sum of its proper divisors (250031170800).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
105055101000 is a wasteful number, since it uses less digits than its factorization.
105055101000 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 11672816 (or 11672799 counting only the distinct ones).
The product of its (nonzero) digits is 125, while the sum is 18.
Adding to 105055101000 its reverse (101550501), we get a palindrome (105156651501).
The spelling of 105055101000 in words is "one hundred five billion, fifty-five million, one hundred one thousand".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •