Base | Representation |
---|---|
bin | 1010011110001001010011… |
… | …10001001011010111100001 |
3 | 10000112021011221202122112201 |
4 | 11033010221301023113201 |
5 | 11004224242212300304 |
6 | 120550001401453201 |
7 | 4564401152214556 |
oct | 517045161132741 |
9 | 100467157678481 |
10 | 23026020431329 |
11 | 737830a278a13 |
12 | 26ba71b7a1201 |
13 | cb046288bb66 |
14 | 598672c46a2d |
15 | 29de5db673a4 |
hex | 14f129c4b5e1 |
23026020431329 has 2 divisors, whose sum is σ = 23026020431330. Its totient is φ = 23026020431328.
The previous prime is 23026020431311. The next prime is 23026020431347. The reversal of 23026020431329 is 92313402062032.
It is a balanced prime because it is at equal distance from previous prime (23026020431311) and next prime (23026020431347).
It can be written as a sum of positive squares in only one way, i.e., 19334031114304 + 3691989317025 = 4397048^2 + 1921455^2 .
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-23026020431329 is a prime.
It is a super-3 number, since 3×230260204313293 (a number of 41 digits) contains 333 as substring.
It is not a weakly prime, because it can be changed into another prime (23026020435329) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 11513010215664 + 11513010215665.
It is an arithmetic number, because the mean of its divisors is an integer number (11513010215665).
Almost surely, 223026020431329 is an apocalyptic number.
It is an amenable number.
23026020431329 is a deficient number, since it is larger than the sum of its proper divisors (1).
23026020431329 is an equidigital number, since it uses as much as digits as its factorization.
23026020431329 is an evil number, because the sum of its binary digits is even.
The product of its (nonzero) digits is 93312, while the sum is 37.
The spelling of 23026020431329 in words is "twenty-three trillion, twenty-six billion, twenty million, four hundred thirty-one thousand, three hundred twenty-nine".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.127 sec. • engine limits •