Base | Representation |
---|---|
bin | 1001001001010010001101… |
… | …10000111101100100111010 |
3 | 2122012112000002120222001002 |
4 | 10210221012300331210322 |
5 | 10113441214333320442 |
6 | 110434302011325002 |
7 | 4143626046415523 |
oct | 444510660754472 |
9 | 78175002528032 |
10 | 20110224120122 |
11 | 6453775274994 |
12 | 23095b5450762 |
13 | b2b5030617a6 |
14 | 4d74a910184a |
15 | 24d1a699e732 |
hex | 124a46c3d93a |
20110224120122 has 8 divisors (see below), whose sum is σ = 30171813612276. Its totient is φ = 10052952916032.
The previous prime is 20110224120121. The next prime is 20110224120139. The reversal of 20110224120122 is 22102142201102.
It is a happy number.
It can be written as a sum of positive squares in 2 ways, for example, as 19992067620001 + 118156500121 = 4471249^2 + 343739^2 .
It is a sphenic number, since it is the product of 3 distinct primes.
It is a super-2 number, since 2×201102241201222 (a number of 27 digits) contains 22 as substring.
It is a junction number, because it is equal to n+sod(n) for n = 20110224120094 and 20110224120103.
It is not an unprimeable number, because it can be changed into a prime (20110224120121) by changing a digit.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 1079560373 + ... + 1079579000.
Almost surely, 220110224120122 is an apocalyptic number.
20110224120122 is a deficient number, since it is larger than the sum of its proper divisors (10061589492154).
20110224120122 is a wasteful number, since it uses less digits than its factorization.
20110224120122 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 2159144032.
The product of its (nonzero) digits is 256, while the sum is 20.
Adding to 20110224120122 its reverse (22102142201102), we get a palindrome (42212366321224).
The spelling of 20110224120122 in words is "twenty trillion, one hundred ten billion, two hundred twenty-four million, one hundred twenty thousand, one hundred twenty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.074 sec. • engine limits •