Base | Representation |
---|---|
bin | 11101011100000101011… |
… | …001101101101010010111 |
3 | 21011101202202110100110122 |
4 | 131130011121231222113 |
5 | 231121121134120002 |
6 | 4145210200142155 |
7 | 266105220113141 |
oct | 35340531555227 |
9 | 7141682410418 |
10 | 2023020223127 |
11 | 70aa5a1a3182 |
12 | 2880a946795b |
13 | 118a01884387 |
14 | 6dcb3d23c91 |
15 | 37953e846a2 |
hex | 1d70566da97 |
2023020223127 has 2 divisors, whose sum is σ = 2023020223128. Its totient is φ = 2023020223126.
The previous prime is 2023020223123. The next prime is 2023020223193. The reversal of 2023020223127 is 7213220203202.
It is a weak prime.
It is a cyclic number.
It is not a de Polignac number, because 2023020223127 - 22 = 2023020223123 is a prime.
It is a super-2 number, since 2×20230202231272 (a number of 25 digits) contains 22 as substring.
It is a junction number, because it is equal to n+sod(n) for n = 2023020223096 and 2023020223105.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (2023020223123) 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, 1011510111563 + 1011510111564.
It is an arithmetic number, because the mean of its divisors is an integer number (1011510111564).
Almost surely, 22023020223127 is an apocalyptic number.
2023020223127 is a deficient number, since it is larger than the sum of its proper divisors (1).
2023020223127 is an equidigital number, since it uses as much as digits as its factorization.
2023020223127 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 4032, while the sum is 26.
Adding to 2023020223127 its reverse (7213220203202), we get a palindrome (9236240426329).
The spelling of 2023020223127 in words is "two trillion, twenty-three billion, twenty million, two hundred twenty-three thousand, one hundred twenty-seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.064 sec. • engine limits •