Base | Representation |
---|---|
bin | 10010010010110110101000… |
… | …00011010011011010010101 |
3 | 12021102222020021222022221222 |
4 | 21021123110003103122111 |
5 | 20233112443130030234 |
6 | 221321301502220125 |
7 | 11321352250052531 |
oct | 1111332403233225 |
9 | 167388207868858 |
10 | 40230221330069 |
11 | 119005a5160911 |
12 | 4618a77884645 |
13 | 195a902a93964 |
14 | 9d122017abc1 |
15 | 49b73143942e |
hex | 2496d40d3695 |
40230221330069 has 2 divisors, whose sum is σ = 40230221330070. Its totient is φ = 40230221330068.
The previous prime is 40230221330023. The next prime is 40230221330071. The reversal of 40230221330069 is 96003312203204.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 26094350877169 + 14135870452900 = 5108263^2 + 3759770^2 .
It is a cyclic number.
It is not a de Polignac number, because 40230221330069 - 28 = 40230221329813 is a prime.
It is a super-2 number, since 2×402302213300692 (a number of 28 digits) contains 22 as substring.
Together with 40230221330071, it forms a pair of twin primes.
It is a Chen prime.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (40230221300069) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 20115110665034 + 20115110665035.
It is an arithmetic number, because the mean of its divisors is an integer number (20115110665035).
Almost surely, 240230221330069 is an apocalyptic number.
It is an amenable number.
40230221330069 is a deficient number, since it is larger than the sum of its proper divisors (1).
40230221330069 is an equidigital number, since it uses as much as digits as its factorization.
40230221330069 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 46656, while the sum is 35.
The spelling of 40230221330069 in words is "forty trillion, two hundred thirty billion, two hundred twenty-one million, three hundred thirty thousand, sixty-nine".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •