Base | Representation |
---|---|
bin | 1010000000101000110001… |
… | …01110110111111101011111 |
3 | 2212221100010122121200022222 |
4 | 11000110120232313331133 |
5 | 10341121311304124043 |
6 | 114452121314455555 |
7 | 4431215624452514 |
oct | 500243056677537 |
9 | 85840118550288 |
10 | 22012122333023 |
11 | 701731a225069 |
12 | 257611b2945bb |
13 | c38971142714 |
14 | 56156ca9130b |
15 | 2828bc1ead68 |
hex | 140518bb7f5f |
22012122333023 has 4 divisors (see below), whose sum is σ = 22012569229128. Its totient is φ = 22011675436920.
The previous prime is 22012122333017. The next prime is 22012122333043. The reversal of 22012122333023 is 32033322121022.
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 22012122333023 - 224 = 22012105555807 is a prime.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 22012122332983 and 22012122333001.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (22012122333043) 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, 223374161 + ... + 223472682.
It is an arithmetic number, because the mean of its divisors is an integer number (5503142307282).
Almost surely, 222012122333023 is an apocalyptic number.
22012122333023 is a deficient number, since it is larger than the sum of its proper divisors (446896105).
22012122333023 is an equidigital number, since it uses as much as digits as its factorization.
22012122333023 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 446896104.
The product of its (nonzero) digits is 5184, while the sum is 26.
Adding to 22012122333023 its reverse (32033322121022), we get a palindrome (54045444454045).
The spelling of 22012122333023 in words is "twenty-two trillion, twelve billion, one hundred twenty-two million, three hundred thirty-three thousand, twenty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •