Base | Representation |
---|---|
bin | 1001001100100010011011… |
… | …11001101100110110101101 |
3 | 2122121012112212002111211102 |
4 | 10212101031321230312231 |
5 | 10122304140312014013 |
6 | 111001510423132445 |
7 | 4154664222263516 |
oct | 446211571546655 |
9 | 78535485074742 |
10 | 20222013001133 |
11 | 6497120174859 |
12 | 23271b32a4125 |
13 | b38c0a057768 |
14 | 4dca71b05a0d |
15 | 25104ab55d58 |
hex | 12644de6cdad |
20222013001133 has 12 divisors (see below), whose sum is σ = 21437196707808. Its totient is φ = 19070361276120.
The previous prime is 20222013001067. The next prime is 20222013001159. The reversal of 20222013001133 is 33110031022202.
It is not a de Polignac number, because 20222013001133 - 28 = 20222013000877 is a prime.
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (20222019001133) by changing a digit.
It is a polite number, since it can be written in 11 ways as a sum of consecutive naturals, for example, 269165735 + ... + 269240852.
It is an arithmetic number, because the mean of its divisors is an integer number (1786433058984).
Almost surely, 220222013001133 is an apocalyptic number.
20222013001133 is a gapful number since it is divisible by the number (23) formed by its first and last digit.
It is an amenable number.
20222013001133 is a deficient number, since it is larger than the sum of its proper divisors (1215183706675).
20222013001133 is an equidigital number, since it uses as much as digits as its factorization.
20222013001133 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 538406704 (or 538406681 counting only the distinct ones).
The product of its (nonzero) digits is 432, while the sum is 20.
Adding to 20222013001133 its reverse (33110031022202), we get a palindrome (53332044023335).
The spelling of 20222013001133 in words is "twenty trillion, two hundred twenty-two billion, thirteen million, one thousand, one hundred thirty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •