Base | Representation |
---|---|
bin | 11001000010001100101011… |
… | …001000001110110011001101 |
3 | 112102211200001100002110220020 |
4 | 121002030223020032303031 |
5 | 103412403311303223041 |
6 | 1030100131311212353 |
7 | 32122423260133140 |
oct | 3102145310166315 |
9 | 472750040073806 |
10 | 110102210211021 |
11 | 3209a0a333a576 |
12 | 104226675170b9 |
13 | 4958794979172 |
14 | 1d28d9273a057 |
15 | cae0279d4866 |
hex | 64232b20eccd |
110102210211021 has 16 divisors (see below), whose sum is σ = 170618437132800. Its totient is φ = 61849183459248.
The previous prime is 110102210210983. The next prime is 110102210211023. The reversal of 110102210211021 is 120112012201011.
It is a happy number.
It is not a de Polignac number, because 110102210211021 - 211 = 110102210208973 is a prime.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (110102210211023) 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, 44431883431 + ... + 44431885908.
It is an arithmetic number, because the mean of its divisors is an integer number (10663652320800).
Almost surely, 2110102210211021 is an apocalyptic number.
It is an amenable number.
110102210211021 is a deficient number, since it is larger than the sum of its proper divisors (60516226921779).
110102210211021 is an equidigital number, since it uses as much as digits as its factorization.
110102210211021 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 88863769408.
The product of its (nonzero) digits is 16, while the sum is 15.
Adding to 110102210211021 its reverse (120112012201011), we get a palindrome (230214222412032).
It can be divided in two parts, 110102210 and 211021, that added together give a triangular number (110313231 = T14853).
The spelling of 110102210211021 in words is "one hundred ten trillion, one hundred two billion, two hundred ten million, two hundred eleven thousand, twenty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •