Base | Representation |
---|---|
bin | 1010001001010111010101… |
… | …11101000110011011111001 |
3 | 2221000000011210011020011102 |
4 | 11010223222331012123321 |
5 | 10411024440004133423 |
6 | 115241554153141145 |
7 | 4461663131654450 |
oct | 504535275063371 |
9 | 87000153136142 |
10 | 22312002021113 |
11 | 7122515517232 |
12 | 26042703ba7b5 |
13 | c5b02206843c |
14 | 571c99c35b97 |
15 | 28a5be041c28 |
hex | 144aeaf466f9 |
22312002021113 has 8 divisors (see below), whose sum is σ = 25880019402432. Its totient is φ = 18839131770096.
The previous prime is 22312002021107. The next prime is 22312002021163. The reversal of 22312002021113 is 31112020021322.
It is a sphenic number, since it is the product of 3 distinct primes.
It is a cyclic number.
It is not a de Polignac number, because 22312002021113 - 214 = 22312002004729 is a prime.
It is a super-3 number, since 3×223120020211133 (a number of 41 digits) contains 333 as substring.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (22312002021163) 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, 23786782070 + ... + 23786783007.
It is an arithmetic number, because the mean of its divisors is an integer number (3235002425304).
Almost surely, 222312002021113 is an apocalyptic number.
It is an amenable number.
22312002021113 is a deficient number, since it is larger than the sum of its proper divisors (3568017381319).
22312002021113 is an equidigital number, since it uses as much as digits as its factorization.
22312002021113 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 47573565151.
The product of its (nonzero) digits is 288, while the sum is 20.
Adding to 22312002021113 its reverse (31112020021322), we get a palindrome (53424022042435).
The spelling of 22312002021113 in words is "twenty-two trillion, three hundred twelve billion, two million, twenty-one thousand, one hundred thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.079 sec. • engine limits •