Base | Representation |
---|---|
bin | 1001001001010101100001… |
… | …01011101011011100000001 |
3 | 2122012200120221022220121102 |
4 | 10210222300223223130001 |
5 | 10114003334241320001 |
6 | 110435154210504145 |
7 | 4144021064600300 |
oct | 444526053533401 |
9 | 78180527286542 |
10 | 20112001120001 |
11 | 64544a734a22a |
12 | 2309a10595055 |
13 | b2b72725a9cb |
14 | 4d75d710c437 |
15 | 24d25c9b2e6b |
hex | 124ab0aeb701 |
20112001120001 has 6 divisors (see below), whose sum is σ = 23395593139650. Its totient is φ = 17238858102816.
The previous prime is 20112001119989. The next prime is 20112001120033. The reversal of 20112001120001 is 10002110021102.
It can be written as a sum of positive squares in only one way, i.e., 19486397635600 + 625603484401 = 4414340^2 + 790951^2 .
It is not a de Polignac number, because 20112001120001 - 226 = 20111934011137 is a prime.
It is a Duffinian number.
It is a Curzon number.
It is not an unprimeable number, because it can be changed into a prime (20112021120001) by changing a digit.
It is a polite number, since it can be written in 5 ways as a sum of consecutive naturals, for example, 205224501176 + ... + 205224501273.
It is an arithmetic number, because the mean of its divisors is an integer number (3899265523275).
Almost surely, 220112001120001 is an apocalyptic number.
It is an amenable number.
20112001120001 is a deficient number, since it is larger than the sum of its proper divisors (3283592019649).
20112001120001 is an equidigital number, since it uses as much as digits as its factorization.
20112001120001 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 410449002463 (or 410449002456 counting only the distinct ones).
The product of its (nonzero) digits is 8, while the sum is 11.
Adding to 20112001120001 its reverse (10002110021102), we get a palindrome (30114111141103).
The spelling of 20112001120001 in words is "twenty trillion, one hundred twelve billion, one million, one hundred twenty thousand, one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •