Base | Representation |
---|---|
bin | 1010000000110111110111… |
… | …0100111001110110111010 |
3 | 1102222120000122112200001212 |
4 | 2200031331310321312322 |
5 | 2420342202210400442 |
6 | 35225550431043122 |
7 | 2214311562362330 |
oct | 240157564716672 |
9 | 42876018480055 |
10 | 11010112200122 |
11 | 35653a93385a2 |
12 | 1299a003704a2 |
13 | 61b331437119 |
14 | 2a0c6c583b50 |
15 | 1415e932ba82 |
hex | a037dd39dba |
11010112200122 has 8 divisors (see below), whose sum is σ = 18874478057376. Its totient is φ = 4718619514332.
The previous prime is 11010112200053. The next prime is 11010112200203. The reversal of 11010112200122 is 22100221101011.
It is a sphenic number, since it is the product of 3 distinct primes.
It is a Harshad number since it is a multiple of its sum of digits (14), and also a Moran number because the ratio is a prime number: 786436585723 = 11010112200122 / (1 + 1 + 0 + 1 + 0 + 1 + 1 + 2 + 2 + 0 + 0 + 1 + 2 + 2).
It is a junction number, because it is equal to n+sod(n) for n = 11010112200097 and 11010112200106.
It is an unprimeable number.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 393218292848 + ... + 393218292875.
It is an arithmetic number, because the mean of its divisors is an integer number (2359309757172).
Almost surely, 211010112200122 is an apocalyptic number.
11010112200122 is a deficient number, since it is larger than the sum of its proper divisors (7864365857254).
11010112200122 is an equidigital number, since it uses as much as digits as its factorization.
11010112200122 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 786436585732.
The product of its (nonzero) digits is 16, while the sum is 14.
Adding to 11010112200122 its reverse (22100221101011), we get a palindrome (33110333301133).
The spelling of 11010112200122 in words is "eleven trillion, ten billion, one hundred twelve million, two hundred thousand, one hundred twenty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.074 sec. • engine limits •