Base | Representation |
---|---|
bin | 1001001100110011001011… |
… | …10001000101011011010001 |
3 | 2122122001202101222112220011 |
4 | 10212121211301011123101 |
5 | 10122431043323032012 |
6 | 111005554501114521 |
7 | 4155433056645556 |
oct | 446314561053321 |
9 | 78561671875804 |
10 | 20231003330257 |
11 | 649aa13a60125 |
12 | 2328aa20b8a41 |
13 | b39a107ccc35 |
14 | 4dd285b20a2d |
15 | 2513c50721a7 |
hex | 126665c456d1 |
20231003330257 has 2 divisors, whose sum is σ = 20231003330258. Its totient is φ = 20231003330256.
The previous prime is 20231003330207. The next prime is 20231003330273. The reversal of 20231003330257 is 75203330013202.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 10166602397121 + 10064400933136 = 3188511^2 + 3172444^2 .
It is a cyclic number.
It is not a de Polignac number, because 20231003330257 - 215 = 20231003297489 is a prime.
It is a super-2 number, since 2×202310033302572 (a number of 27 digits) contains 22 as substring.
It is not a weakly prime, because it can be changed into another prime (20231003330207) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 10115501665128 + 10115501665129.
It is an arithmetic number, because the mean of its divisors is an integer number (10115501665129).
Almost surely, 220231003330257 is an apocalyptic number.
It is an amenable number.
20231003330257 is a deficient number, since it is larger than the sum of its proper divisors (1).
20231003330257 is an equidigital number, since it uses as much as digits as its factorization.
20231003330257 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 22680, while the sum is 31.
Adding to 20231003330257 its reverse (75203330013202), we get a palindrome (95434333343459).
The spelling of 20231003330257 in words is "twenty trillion, two hundred thirty-one billion, three million, three hundred thirty thousand, two hundred fifty-seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •