Base | Representation |
---|---|
bin | 11001000010011101010101… |
… | …011100101111100001110101 |
3 | 112102220101020010002000021211 |
4 | 121002131111130233201311 |
5 | 103413201431111201323 |
6 | 1030112250421441421 |
7 | 32123625510522400 |
oct | 3102352534574165 |
9 | 472811203060254 |
10 | 110120100100213 |
11 | 320a6743755065 |
12 | 1042601a870271 |
13 | 495a386135b08 |
14 | 1d29bac6a2d37 |
15 | cae72338c70d |
hex | 64275572f875 |
110120100100213 has 12 divisors (see below), whose sum is σ = 128742604989600. Its totient is φ = 93914342359992.
The previous prime is 110120100100201. The next prime is 110120100100271. The reversal of 110120100100213 is 312001001021011.
It is a happy number.
It is not a de Polignac number, because 110120100100213 - 221 = 110120098003061 is a prime.
It is a junction number, because it is equal to n+sod(n) for n = 110120100100193 and 110120100100202.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (110120100106213) by changing a digit.
It is a polite number, since it can be written in 11 ways as a sum of consecutive naturals, for example, 5646595731 + ... + 5646615232.
It is an arithmetic number, because the mean of its divisors is an integer number (10728550415800).
Almost surely, 2110120100100213 is an apocalyptic number.
It is an amenable number.
110120100100213 is a deficient number, since it is larger than the sum of its proper divisors (18622504889387).
110120100100213 is a wasteful number, since it uses less digits than its factorization.
110120100100213 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 11293211176 (or 11293211169 counting only the distinct ones).
The product of its (nonzero) digits is 12, while the sum is 13.
Adding to 110120100100213 its reverse (312001001021011), we get a palindrome (422121101121224).
The spelling of 110120100100213 in words is "one hundred ten trillion, one hundred twenty billion, one hundred million, one hundred thousand, two hundred thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •