Base | Representation |
---|---|
bin | 1001001100100001010101… |
… | …01111011111011011000001 |
3 | 2122121011000202010112221022 |
4 | 10212100222233133123001 |
5 | 10122301433304401423 |
6 | 111001332112035225 |
7 | 4154643500346563 |
oct | 446205257373301 |
9 | 78534022115838 |
10 | 20221423122113 |
11 | 64969481a9a34 |
12 | 2327069832b15 |
13 | b38b44a93815 |
14 | 4dca17635333 |
15 | 251013e86dc8 |
hex | 12642abdf6c1 |
20221423122113 has 2 divisors, whose sum is σ = 20221423122114. Its totient is φ = 20221423122112.
The previous prime is 20221423122079. The next prime is 20221423122193. The reversal of 20221423122113 is 31122132412202.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 16626030715009 + 3595392407104 = 4077503^2 + 1896152^2 .
It is a cyclic number.
It is not a de Polignac number, because 20221423122113 - 28 = 20221423121857 is a prime.
It is not a weakly prime, because it can be changed into another prime (20221423122193) 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 as a sum of consecutive naturals, namely, 10110711561056 + 10110711561057.
It is an arithmetic number, because the mean of its divisors is an integer number (10110711561057).
Almost surely, 220221423122113 is an apocalyptic number.
It is an amenable number.
20221423122113 is a deficient number, since it is larger than the sum of its proper divisors (1).
20221423122113 is an equidigital number, since it uses as much as digits as its factorization.
20221423122113 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 2304, while the sum is 26.
Adding to 20221423122113 its reverse (31122132412202), we get a palindrome (51343555534315).
The spelling of 20221423122113 in words is "twenty trillion, two hundred twenty-one billion, four hundred twenty-three million, one hundred twenty-two thousand, one hundred thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.084 sec. • engine limits •