Base | Representation |
---|---|
bin | 1010000110101100110000… |
… | …1111010101100101111010 |
3 | 1110100010101202222101011212 |
4 | 2201223030033111211322 |
5 | 2424012203233000442 |
6 | 35343543321123122 |
7 | 2224454260551044 |
oct | 241531417254572 |
9 | 43303352871155 |
10 | 11110212000122 |
11 | 35a38a6038934 |
12 | 12b52976294a2 |
13 | 6278c481a301 |
14 | 2a5a46982a94 |
15 | 1440071cba82 |
hex | a1acc3d597a |
11110212000122 has 8 divisors (see below), whose sum is σ = 16852568764500. Its totient is φ = 5492689078624.
The previous prime is 11110212000119. The next prime is 11110212000127. The reversal of 11110212000122 is 22100021201111.
It can be written as a sum of positive squares in 2 ways, for example, as 10713779322481 + 396432677641 = 3273191^2 + 629629^2 .
It is a sphenic number, since it is the product of 3 distinct primes.
It is a junction number, because it is equal to n+sod(n) for n = 11110212000097 and 11110212000106.
It is not an unprimeable number, because it can be changed into a prime (11110212000127) 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 3 ways as a sum of consecutive naturals, for example, 31208460497 + ... + 31208460852.
Almost surely, 211110212000122 is an apocalyptic number.
11110212000122 is a deficient number, since it is larger than the sum of its proper divisors (5742356764378).
11110212000122 is an equidigital number, since it uses as much as digits as its factorization.
11110212000122 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 62416921440.
The product of its (nonzero) digits is 16, while the sum is 14.
Adding to 11110212000122 its reverse (22100021201111), we get a palindrome (33210233201233).
The spelling of 11110212000122 in words is "eleven trillion, one hundred ten billion, two hundred twelve million, one hundred twenty-two", and thus it is an aban number.
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.074 sec. • engine limits •