Base | Representation |
---|---|
bin | 11101011100001111011… |
… | …111010111010011001101 |
3 | 21011102012112221022112012 |
4 | 131130033133113103031 |
5 | 231121443001222212 |
6 | 4145235043551005 |
7 | 266112343542314 |
oct | 35341737272315 |
9 | 7142175838465 |
10 | 2023189476557 |
11 | 710036795847 |
12 | 28813608b465 |
13 | 118a2a964932 |
14 | 6dccc5c127b |
15 | 37963c68922 |
hex | 1d70f7d74cd |
2023189476557 has 2 divisors, whose sum is σ = 2023189476558. Its totient is φ = 2023189476556.
The previous prime is 2023189476547. The next prime is 2023189476589. The reversal of 2023189476557 is 7556749813202.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 1973165233636 + 50024242921 = 1404694^2 + 223661^2 .
It is a cyclic number.
It is not a de Polignac number, because 2023189476557 - 230 = 2022115734733 is a prime.
It is a junction number, because it is equal to n+sod(n) for n = 2023189476496 and 2023189476505.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (2023189476547) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 1011594738278 + 1011594738279.
It is an arithmetic number, because the mean of its divisors is an integer number (1011594738279).
It is a 1-persistent number, because it is pandigital, but 2⋅2023189476557 = 4046378953114 is not.
Almost surely, 22023189476557 is an apocalyptic number.
It is an amenable number.
2023189476557 is a deficient number, since it is larger than the sum of its proper divisors (1).
2023189476557 is an equidigital number, since it uses as much as digits as its factorization.
2023189476557 is an evil number, because the sum of its binary digits is even.
The product of its (nonzero) digits is 25401600, while the sum is 59.
The spelling of 2023189476557 in words is "two trillion, twenty-three billion, one hundred eighty-nine million, four hundred seventy-six thousand, five hundred fifty-seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •