Base | Representation |
---|---|
bin | 1010000000111001111000… |
… | …11111100000101111011011 |
3 | 2212222012212010000022110212 |
4 | 11000130330133200233123 |
5 | 10341244121412020443 |
6 | 114500241242001335 |
7 | 4431662434301336 |
oct | 500347437405733 |
9 | 85865763008425 |
10 | 22021312220123 |
11 | 7020205721287 |
12 | 2577a64aa624b |
13 | c397a7048c38 |
14 | 561ba13b561d |
15 | 282c58dd5618 |
hex | 14073c7e0bdb |
22021312220123 has 4 divisors (see below), whose sum is σ = 22062017049168. Its totient is φ = 21980607391080.
The previous prime is 22021312220107. The next prime is 22021312220147. The reversal of 22021312220123 is 32102221312022.
It is a happy number.
It is a semiprime because it is the product of two primes.
It is a cyclic number.
It is not a de Polignac number, because 22021312220123 - 24 = 22021312220107 is a prime.
It is a super-2 number, since 2×220213122201232 (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 (22021312220423) 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, 20352413711 + ... + 20352414792.
It is an arithmetic number, because the mean of its divisors is an integer number (5515504262292).
Almost surely, 222021312220123 is an apocalyptic number.
22021312220123 is a deficient number, since it is larger than the sum of its proper divisors (40704829045).
22021312220123 is an equidigital number, since it uses as much as digits as its factorization.
22021312220123 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 40704829044.
The product of its (nonzero) digits is 1152, while the sum is 23.
Adding to 22021312220123 its reverse (32102221312022), we get a palindrome (54123533532145).
The spelling of 22021312220123 in words is "twenty-two trillion, twenty-one billion, three hundred twelve million, two hundred twenty thousand, one hundred twenty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.087 sec. • engine limits •