Base | Representation |
---|---|
bin | 11101001000101110111… |
… | …01111011100100101010 |
3 | 10112201001211222022110212 |
4 | 32210113131323210222 |
5 | 112400244000231442 |
6 | 2043524135341122 |
7 | 132220466651231 |
oct | 16442735734452 |
9 | 3481054868425 |
10 | 1001121102122 |
11 | 356633843579 |
12 | 1420355217a2 |
13 | 7353662748b |
14 | 366512b9b18 |
15 | 1b094db9a82 |
hex | e91777b92a |
1001121102122 has 8 divisors (see below), whose sum is σ = 1505542018500. Its totient is φ = 499273762624.
The previous prime is 1001121102089. The next prime is 1001121102127. The reversal of 1001121102122 is 2212011211001.
It can be written as a sum of positive squares in 2 ways, for example, as 980454452041 + 20666650081 = 990179^2 + 143759^2 .
It is a sphenic number, since it is the product of 3 distinct primes.
It is a super-2 number, since 2×10011211021222 (a number of 25 digits) contains 22 as substring.
It is a junction number, because it is equal to n+sod(n) for n = 1001121102097 and 1001121102106.
It is not an unprimeable number, because it can be changed into a prime (1001121102127) 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, 643393247 + ... + 643394802.
Almost surely, 21001121102122 is an apocalyptic number.
1001121102122 is a deficient number, since it is larger than the sum of its proper divisors (504420916378).
1001121102122 is a wasteful number, since it uses less digits than its factorization.
1001121102122 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1286788440.
The product of its (nonzero) digits is 16, while the sum is 14.
Adding to 1001121102122 its reverse (2212011211001), we get a palindrome (3213132313123).
The spelling of 1001121102122 in words is "one trillion, one billion, one hundred twenty-one million, one hundred two thousand, one hundred twenty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •