Base | Representation |
---|---|
bin | 1010000011110101101010… |
… | …10010001100101110011101 |
3 | 2220022212001210022121201120 |
4 | 11001322311102030232131 |
5 | 10344422101443134323 |
6 | 115014432451201153 |
7 | 4442161555050405 |
oct | 501726522145635 |
9 | 86285053277646 |
10 | 22122123021213 |
11 | 7059a377a5226 |
12 | 25934ba2a61b9 |
13 | c46151820927 |
14 | 566a05db3805 |
15 | 2856a93cc5e3 |
hex | 141eb548cb9d |
22122123021213 has 8 divisors (see below), whose sum is σ = 31231232500608. Its totient is φ = 13880547777984.
The previous prime is 22122123021139. The next prime is 22122123021227. The reversal of 22122123021213 is 31212032122122.
It is a sphenic number, since it is the product of 3 distinct primes.
It is not a de Polignac number, because 22122123021213 - 214 = 22122123004829 is a prime.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (22122123021413) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (23) of ones.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 216883558981 + ... + 216883559082.
It is an arithmetic number, because the mean of its divisors is an integer number (3903904062576).
Almost surely, 222122123021213 is an apocalyptic number.
It is an amenable number.
22122123021213 is a deficient number, since it is larger than the sum of its proper divisors (9109109479395).
22122123021213 is a wasteful number, since it uses less digits than its factorization.
22122123021213 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 433767118083.
The product of its (nonzero) digits is 1152, while the sum is 24.
Adding to 22122123021213 its reverse (31212032122122), we get a palindrome (53334155143335).
The spelling of 22122123021213 in words is "twenty-two trillion, one hundred twenty-two billion, one hundred twenty-three million, twenty-one thousand, two hundred thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.067 sec. • engine limits •