Base | Representation |
---|---|
bin | 11101011100000101011… |
… | …010011110001111111101 |
3 | 21011101202202211110110112 |
4 | 131130011122132033331 |
5 | 231121121212002031 |
6 | 4145210204315405 |
7 | 266105221602305 |
oct | 35340532361775 |
9 | 7141682743415 |
10 | 2023020422141 |
11 | 70aa5a319754 |
12 | 2880a9542b65 |
13 | 118a01923b34 |
14 | 6dcb3d76605 |
15 | 37953ec362b |
hex | 1d70569e3fd |
2023020422141 has 2 divisors, whose sum is σ = 2023020422142. Its totient is φ = 2023020422140.
The previous prime is 2023020422077. The next prime is 2023020422147. The reversal of 2023020422141 is 1412240203202.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 1800829802500 + 222190619641 = 1341950^2 + 471371^2 .
It is a cyclic number.
It is not a de Polignac number, because 2023020422141 - 26 = 2023020422077 is a prime.
It is a super-2 number, since 2×20230204221412 (a number of 25 digits) contains 22 as substring.
It is a Sophie Germain prime.
It is a Curzon number.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (2023020422147) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 1011510211070 + 1011510211071.
It is an arithmetic number, because the mean of its divisors is an integer number (1011510211071).
Almost surely, 22023020422141 is an apocalyptic number.
It is an amenable number.
2023020422141 is a deficient number, since it is larger than the sum of its proper divisors (1).
2023020422141 is an equidigital number, since it uses as much as digits as its factorization.
2023020422141 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 1536, while the sum is 23.
Adding to 2023020422141 its reverse (1412240203202), we get a palindrome (3435260625343).
The spelling of 2023020422141 in words is "two trillion, twenty-three billion, twenty million, four hundred twenty-two thousand, one hundred forty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •