Base | Representation |
---|---|
bin | 11001000010001100011110… |
… | …100110110011010100010111 |
3 | 112102211122111200202210201110 |
4 | 121002030132212303110113 |
5 | 103412402344012333421 |
6 | 1030100054404230103 |
7 | 32122415126323125 |
oct | 3102143646632427 |
9 | 472748450683643 |
10 | 110102000121111 |
11 | 32099aa5795949 |
12 | 1042260909b333 |
13 | 495876029b3cb |
14 | 1d28d7288c915 |
15 | cae014335a76 |
hex | 64231e9b3517 |
110102000121111 has 12 divisors (see below), whose sum is σ = 150877539981672. Its totient is φ = 71417513589408.
The previous prime is 110102000121083. The next prime is 110102000121151. The reversal of 110102000121111 is 111121000201011.
It is not a de Polignac number, because 110102000121111 - 211 = 110102000119063 is a prime.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (110102000121151) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (23) of ones.
It is a polite number, since it can be written in 11 ways as a sum of consecutive naturals, for example, 13404183880 + ... + 13404192093.
It is an arithmetic number, because the mean of its divisors is an integer number (12573128331806).
Almost surely, 2110102000121111 is an apocalyptic number.
110102000121111 is a deficient number, since it is larger than the sum of its proper divisors (40775539860561).
110102000121111 is an equidigital number, since it uses as much as digits as its factorization.
110102000121111 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 26808376050 (or 26808376013 counting only the distinct ones).
The product of its (nonzero) digits is 4, while the sum is 12.
Adding to 110102000121111 its reverse (111121000201011), we get a palindrome (221223000322122).
The spelling of 110102000121111 in words is "one hundred ten trillion, one hundred two billion, one hundred twenty-one thousand, one hundred eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.074 sec. • engine limits •