Base | Representation |
---|---|
bin | 110000111001001111… |
… | …1101000101110100010 |
3 | 101001000122020022002101 |
4 | 1201302133220232202 |
5 | 3210020012023020 |
6 | 120123020441014 |
7 | 10405000134424 |
oct | 1416237505642 |
9 | 331018208071 |
10 | 105000111010 |
11 | 40591909553 |
12 | 184243a916a |
13 | 9b946a9a02 |
14 | 5121150814 |
15 | 2ae81b400a |
hex | 18727e8ba2 |
105000111010 has 24 divisors (see below), whose sum is σ = 192633576660. Its totient is φ = 41207579712.
The previous prime is 105000111001. The next prime is 105000111017. The reversal of 105000111010 is 10111000501.
It can be written as a sum of positive squares in 6 ways, for example, as 46112838121 + 58887272889 = 214739^2 + 242667^2 .
It is a super-2 number, since 2×1050001110102 (a number of 23 digits) contains 22 as substring.
It is a Harshad number since it is a multiple of its sum of digits (10).
It is not an unprimeable number, because it can be changed into a prime (105000111017) 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 11 ways as a sum of consecutive naturals, for example, 1840905 + ... + 1897084.
Almost surely, 2105000111010 is an apocalyptic number.
105000111010 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
105000111010 is a deficient number, since it is larger than the sum of its proper divisors (87633465650).
105000111010 is an equidigital number, since it uses as much as digits as its factorization.
105000111010 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 3738102 (or 3738049 counting only the distinct ones).
The product of its (nonzero) digits is 5, while the sum is 10.
Adding to 105000111010 its reverse (10111000501), we get a palindrome (115111111511).
The spelling of 105000111010 in words is "one hundred five billion, one hundred eleven thousand, ten".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.063 sec. • engine limits •