Base | Representation |
---|---|
bin | 1010000000100101000000… |
… | …10001010010011101100011 |
3 | 2212221010220210201010202201 |
4 | 11000102200101102131203 |
5 | 10341103141413430311 |
6 | 114451145001154031 |
7 | 4431114554165140 |
oct | 500224021223543 |
9 | 85833823633681 |
10 | 22010101311331 |
11 | 701648242a601 |
12 | 257585648b917 |
13 | c3870b517bb3 |
14 | 56141a4c33c7 |
15 | 2827eea849c1 |
hex | 1404a0452763 |
22010101311331 has 16 divisors (see below), whose sum is σ = 26659175129280. Its totient is φ = 17739312814080.
The previous prime is 22010101311329. The next prime is 22010101311349. The reversal of 22010101311331 is 13311310101022.
It is a cyclic number.
It is not a de Polignac number, because 22010101311331 - 21 = 22010101311329 is a prime.
It is a super-2 number, since 2×220101013113312 (a number of 27 digits) contains 22 as substring.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 22010101311299 and 22010101311308.
It is not an unprimeable number, because it can be changed into a prime (22010101371331) by changing a digit.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 87036246 + ... + 87288763.
It is an arithmetic number, because the mean of its divisors is an integer number (1666198445580).
Almost surely, 222010101311331 is an apocalyptic number.
22010101311331 is a deficient number, since it is larger than the sum of its proper divisors (4649073817949).
22010101311331 is a wasteful number, since it uses less digits than its factorization.
22010101311331 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 174326094.
The product of its (nonzero) digits is 108, while the sum is 19.
Adding to 22010101311331 its reverse (13311310101022), we get a palindrome (35321411412353).
The spelling of 22010101311331 in words is "twenty-two trillion, ten billion, one hundred one million, three hundred eleven thousand, three hundred thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.074 sec. • engine limits •