Base | Representation |
---|---|
bin | 110001010101110110101110… |
… | …1000001111000110011100001 |
3 | 2002220201011121111011022202212 |
4 | 1202223231131001320303201 |
5 | 423341324143024112001 |
6 | 4135022255405251505 |
7 | 160263232262212256 |
oct | 14253553501706341 |
9 | 2086634544138685 |
10 | 434012301004001 |
11 | 11632064626a725 |
12 | 408165a9563b95 |
13 | 158232520aa005 |
14 | 792644390742d |
15 | 35299c8c8e7bb |
hex | 18abb5d078ce1 |
434012301004001 has 2 divisors, whose sum is σ = 434012301004002. Its totient is φ = 434012301004000.
The previous prime is 434012301003929. The next prime is 434012301004003. The reversal of 434012301004001 is 100400103210434.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 316402093413025 + 117610207590976 = 17787695^2 + 10844824^2 .
It is a cyclic number.
It is not a de Polignac number, because 434012301004001 - 218 = 434012300741857 is a prime.
Together with 434012301004003, it forms a pair of twin primes.
It is a Chen prime.
It is not a weakly prime, because it can be changed into another prime (434012301004003) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 217006150502000 + 217006150502001.
It is an arithmetic number, because the mean of its divisors is an integer number (217006150502001).
Almost surely, 2434012301004001 is an apocalyptic number.
It is an amenable number.
434012301004001 is a deficient number, since it is larger than the sum of its proper divisors (1).
434012301004001 is an equidigital number, since it uses as much as digits as its factorization.
434012301004001 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 1152, while the sum is 23.
Adding to 434012301004001 its reverse (100400103210434), we get a palindrome (534412404214435).
The spelling of 434012301004001 in words is "four hundred thirty-four trillion, twelve billion, three hundred one million, four thousand, one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.080 sec. • engine limits •