Base | Representation |
---|---|
bin | 1100101001001110011… |
… | …11101010011001000001 |
3 | 1112112101120112111022011 |
4 | 12110213033222121001 |
5 | 24104223212122423 |
6 | 531330021412521 |
7 | 43250036016331 |
oct | 6244717523101 |
9 | 1475346474264 |
10 | 434450114113 |
11 | 158281843a94 |
12 | 7024856a141 |
13 | 31c78961752 |
14 | 1705564d0c1 |
15 | b47b059b0d |
hex | 65273ea641 |
434450114113 has 2 divisors, whose sum is σ = 434450114114. Its totient is φ = 434450114112.
The previous prime is 434450114099. The next prime is 434450114117. The reversal of 434450114113 is 311411054434.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 230153346049 + 204296768064 = 479743^2 + 451992^2 .
It is a cyclic number.
It is not a de Polignac number, because 434450114113 - 25 = 434450114081 is a prime.
It is a super-3 number, since 3×4344501141133 (a number of 36 digits) contains 333 as substring.
It is not a weakly prime, because it can be changed into another prime (434450114117) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 217225057056 + 217225057057.
It is an arithmetic number, because the mean of its divisors is an integer number (217225057057).
Almost surely, 2434450114113 is an apocalyptic number.
It is an amenable number.
434450114113 is a deficient number, since it is larger than the sum of its proper divisors (1).
434450114113 is an equidigital number, since it uses as much as digits as its factorization.
434450114113 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 11520, while the sum is 31.
Adding to 434450114113 its reverse (311411054434), we get a palindrome (745861168547).
The spelling of 434450114113 in words is "four hundred thirty-four billion, four hundred fifty million, one hundred fourteen thousand, one hundred thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.067 sec. • engine limits •