Base | Representation |
---|---|
bin | 1010000000111011011001… |
… | …01101100100000010100111 |
3 | 2212222021221111021020222202 |
4 | 11000131230231210002213 |
5 | 10341302301012210043 |
6 | 114500453421245115 |
7 | 4432021456506434 |
oct | 500355455440247 |
9 | 85867844236882 |
10 | 22022121210023 |
11 | 7020590342380 |
12 | 257804ba0379b |
13 | c398a582899c |
14 | 561c3aa00b8b |
15 | 282ca4e361b8 |
hex | 14076cb640a7 |
22022121210023 has 8 divisors (see below), whose sum is σ = 24382701367680. Its totient is φ = 19721302575480.
The previous prime is 22022121209993. The next prime is 22022121210071. The reversal of 22022121210023 is 32001212122022.
It is a sphenic number, since it is the product of 3 distinct primes.
It is not a de Polignac number, because 22022121210023 - 216 = 22022121144487 is a prime.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 22022121209977 and 22022121210004.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (22022121212023) 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, 14940380003 + ... + 14940381476.
It is an arithmetic number, because the mean of its divisors is an integer number (3047837670960).
Almost surely, 222022121210023 is an apocalyptic number.
22022121210023 is a deficient number, since it is larger than the sum of its proper divisors (2360580157657).
22022121210023 is a wasteful number, since it uses less digits than its factorization.
22022121210023 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 29880761557.
The product of its (nonzero) digits is 384, while the sum is 20.
Adding to 22022121210023 its reverse (32001212122022), we get a palindrome (54023333332045).
The spelling of 22022121210023 in words is "twenty-two trillion, twenty-two billion, one hundred twenty-one million, two hundred ten thousand, twenty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •