Base | Representation |
---|---|
bin | 1010011101011110110101… |
… | …10000110100010011001001 |
3 | 10000110002022221220211021211 |
4 | 11032233122300310103021 |
5 | 11003341043321202142 |
6 | 120531311115333121 |
7 | 4562633144463343 |
oct | 516573260642311 |
9 | 100402287824254 |
10 | 23003220100297 |
11 | 736967a065828 |
12 | 26b6217a511a1 |
13 | cab26ac9c418 |
14 | 59750ca92293 |
15 | 29d577148917 |
hex | 14ebdac344c9 |
23003220100297 has 2 divisors, whose sum is σ = 23003220100298. Its totient is φ = 23003220100296.
The previous prime is 23003220100199. The next prime is 23003220100313. The reversal of 23003220100297 is 79200102230032.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 18975267435721 + 4027952664576 = 4356061^2 + 2006976^2 .
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-23003220100297 is a prime.
It is a super-3 number, since 3×230032201002973 (a number of 41 digits) contains 333 as substring.
It is not a weakly prime, because it can be changed into another prime (23003220106297) 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, 11501610050148 + 11501610050149.
It is an arithmetic number, because the mean of its divisors is an integer number (11501610050149).
Almost surely, 223003220100297 is an apocalyptic number.
It is an amenable number.
23003220100297 is a deficient number, since it is larger than the sum of its proper divisors (1).
23003220100297 is an equidigital number, since it uses as much as digits as its factorization.
23003220100297 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 9072, while the sum is 31.
The spelling of 23003220100297 in words is "twenty-three trillion, three billion, two hundred twenty million, one hundred thousand, two hundred ninety-seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •