Base | Representation |
---|---|
bin | 1010000000010100010011… |
… | …01010011101111011010011 |
3 | 2212220021202201120001200202 |
4 | 11000022021222131323103 |
5 | 10340431304304220311 |
6 | 114443103000005415 |
7 | 4430346364152635 |
oct | 500121152357323 |
9 | 85807681501622 |
10 | 22001132101331 |
11 | 701269a559359 |
12 | 2573b7276086b |
13 | c3790c258346 |
14 | 560c09204a55 |
15 | 28247743ae3b |
hex | 140289a9ded3 |
22001132101331 has 8 divisors (see below), whose sum is σ = 22003726993920. Its totient is φ = 21998537398152.
The previous prime is 22001132101237. The next prime is 22001132101339. The reversal of 22001132101331 is 13310123110022.
It is a happy number.
It is a sphenic number, since it is the product of 3 distinct primes.
It is a cyclic number.
It is not a de Polignac number, because 22001132101331 - 234 = 21983952232147 is a prime.
It is a super-2 number, since 2×220011321013312 (a number of 27 digits) contains 22 as substring.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (22001132101339) by changing a digit.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 403641026 + ... + 403695528.
It is an arithmetic number, because the mean of its divisors is an integer number (2750465874240).
Almost surely, 222001132101331 is an apocalyptic number.
22001132101331 is a deficient number, since it is larger than the sum of its proper divisors (2594892589).
22001132101331 is a wasteful number, since it uses less digits than its factorization.
22001132101331 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 94705.
The product of its (nonzero) digits is 216, while the sum is 20.
Adding to 22001132101331 its reverse (13310123110022), we get a palindrome (35311255211353).
The spelling of 22001132101331 in words is "twenty-two trillion, one billion, one hundred thirty-two million, one hundred one thousand, three hundred thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •