Base | Representation |
---|---|
bin | 1001001100110011110010… |
… | …10000011111101001011101 |
3 | 2122122002121012021220220021 |
4 | 10212121321100133221131 |
5 | 10122432231031044404 |
6 | 111010051141552141 |
7 | 4155444140263303 |
oct | 446317120375135 |
9 | 78562535256807 |
10 | 20231330331229 |
11 | 64a00715a6866 |
12 | 2328b73715651 |
13 | b39a63492934 |
14 | 4dd2b7322273 |
15 | 2513e3b16454 |
hex | 12667941fa5d |
20231330331229 has 2 divisors, whose sum is σ = 20231330331230. Its totient is φ = 20231330331228.
The previous prime is 20231330331227. The next prime is 20231330331269. The reversal of 20231330331229 is 92213303313202.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 16083989935225 + 4147340396004 = 4010485^2 + 2036502^2 .
It is a cyclic number.
It is not a de Polignac number, because 20231330331229 - 21 = 20231330331227 is a prime.
Together with 20231330331227, it forms a pair of twin primes.
It is a junction number, because it is equal to n+sod(n) for n = 20231330331194 and 20231330331203.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (20231330331227) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 10115665165614 + 10115665165615.
It is an arithmetic number, because the mean of its divisors is an integer number (10115665165615).
Almost surely, 220231330331229 is an apocalyptic number.
It is an amenable number.
20231330331229 is a deficient number, since it is larger than the sum of its proper divisors (1).
20231330331229 is an equidigital number, since it uses as much as digits as its factorization.
20231330331229 is an evil number, because the sum of its binary digits is even.
The product of its (nonzero) digits is 34992, while the sum is 34.
The spelling of 20231330331229 in words is "twenty trillion, two hundred thirty-one billion, three hundred thirty million, three hundred thirty-one thousand, two hundred twenty-nine".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.093 sec. • engine limits •