Base | Representation |
---|---|
bin | 101110100111001111… |
… | …1000011101010001111 |
3 | 100120101012201021211000 |
4 | 1131032133003222033 |
5 | 3120001324341421 |
6 | 113552532031343 |
7 | 10142411364312 |
oct | 1351637035217 |
9 | 316335637730 |
10 | 100101012111 |
11 | 394a8458a91 |
12 | 17497762553 |
13 | 9593718b19 |
14 | 4bb8636979 |
15 | 290d03e226 |
hex | 174e7c3a8f |
100101012111 has 16 divisors (see below), whose sum is σ = 148333619200. Its totient is φ = 66717887544.
The previous prime is 100101012079. The next prime is 100101012133. The reversal of 100101012111 is 111210101001.
It is not a de Polignac number, because 100101012111 - 25 = 100101012079 is a prime.
It is a Harshad number since it is a multiple of its sum of digits (9).
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 100101012093 and 100101012102.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (100101012211) by changing a digit.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 333421 + ... + 558006.
It is an arithmetic number, because the mean of its divisors is an integer number (9270851200).
Almost surely, 2100101012111 is an apocalyptic number.
100101012111 is a deficient number, since it is larger than the sum of its proper divisors (48232607089).
100101012111 is an equidigital number, since it uses as much as digits as its factorization.
100101012111 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 895595 (or 895589 counting only the distinct ones).
The product of its (nonzero) digits is 2, while the sum is 9.
Adding to 100101012111 its reverse (111210101001), we get a palindrome (211311113112).
It can be divided in two parts, 10010 and 1012111, that added together give a square (1022121 = 10112).
The spelling of 100101012111 in words is "one hundred billion, one hundred one million, twelve thousand, one hundred eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •