Base | Representation |
---|---|
bin | 1010000000110111110111… |
… | …0100100001111011101010 |
3 | 1102222120000122100200122020 |
4 | 2200031331310201323222 |
5 | 2420342202144231442 |
6 | 35225550425005310 |
7 | 2214311561503530 |
oct | 240157564417352 |
9 | 42876018320566 |
10 | 11010112102122 |
11 | 35653a9280a01 |
12 | 1299a00323836 |
13 | 61b331401633 |
14 | 2a0c6c55a150 |
15 | 1415e930c9ec |
hex | a037dd21eea |
11010112102122 has 128 divisors (see below), whose sum is σ = 27268891398144. Its totient is φ = 2891542606848.
The previous prime is 11010112102111. The next prime is 11010112102153. The reversal of 11010112102122 is 22120121101011.
It is a happy number.
It is an unprimeable number.
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 63 ways as a sum of consecutive naturals, for example, 539516043 + ... + 539536449.
It is an arithmetic number, because the mean of its divisors is an integer number (213038214048).
Almost surely, 211010112102122 is an apocalyptic number.
It is a practical number, because each smaller number is the sum of distinct divisors of 11010112102122, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (13634445699072).
11010112102122 is an abundant number, since it is smaller than the sum of its proper divisors (16258779296022).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
11010112102122 is a wasteful number, since it uses less digits than its factorization.
11010112102122 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 38052.
The product of its (nonzero) digits is 16, while the sum is 15.
Adding to 11010112102122 its reverse (22120121101011), we get a palindrome (33130233203133).
The spelling of 11010112102122 in words is "eleven trillion, ten billion, one hundred twelve million, one hundred two thousand, one hundred twenty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •