Base | Representation |
---|---|
bin | 101111110011000110101111… |
… | …110000011001000010111111 |
3 | 1000120022211212211010100211101 |
4 | 233303012233300121002333 |
5 | 210023221302442013043 |
6 | 2023033442530233531 |
7 | 62164621422423442 |
oct | 5763065760310277 |
9 | 1016284784110741 |
10 | 210220123001023 |
11 | 60a89943009023 |
12 | 1b6b2099a258a7 |
13 | 903b898749065 |
14 | 39ca9cb5b7659 |
15 | 1948493dbc24d |
hex | bf31afc190bf |
210220123001023 has 2 divisors, whose sum is σ = 210220123001024. Its totient is φ = 210220123001022.
The previous prime is 210220123001017. The next prime is 210220123001029. The reversal of 210220123001023 is 320100321022012.
It is a balanced prime because it is at equal distance from previous prime (210220123001017) and next prime (210220123001029).
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-210220123001023 is a prime.
It is a super-2 number, since 2×2102201230010232 (a number of 29 digits) contains 22 as substring.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (210220123001029) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 105110061500511 + 105110061500512.
It is an arithmetic number, because the mean of its divisors is an integer number (105110061500512).
Almost surely, 2210220123001023 is an apocalyptic number.
210220123001023 is a deficient number, since it is larger than the sum of its proper divisors (1).
210220123001023 is an equidigital number, since it uses as much as digits as its factorization.
210220123001023 is an evil number, because the sum of its binary digits is even.
The product of its (nonzero) digits is 288, while the sum is 19.
Adding to 210220123001023 its reverse (320100321022012), we get a palindrome (530320444023035).
The spelling of 210220123001023 in words is "two hundred ten trillion, two hundred twenty billion, one hundred twenty-three million, one thousand, twenty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.083 sec. • engine limits •