Base | Representation |
---|---|
bin | 11110100011000100100010… |
… | …000110100110100110000101 |
3 | 122121200212120010212020010001 |
4 | 132203010202012212212011 |
5 | 120102203224200024334 |
6 | 1153424111255401301 |
7 | 40204400013506011 |
oct | 3643044206464605 |
9 | 577625503766101 |
10 | 134351444142469 |
11 | 39899144757814 |
12 | 1309a262983231 |
13 | 59c73961b4bb8 |
14 | 2526904a93541 |
15 | 107ebc926b714 |
hex | 7a31221a6985 |
134351444142469 has 2 divisors, whose sum is σ = 134351444142470. Its totient is φ = 134351444142468.
The previous prime is 134351444142403. The next prime is 134351444142479. The reversal of 134351444142469 is 964241444153431.
It is a happy number.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 131699448177444 + 2651995965025 = 11476038^2 + 1628495^2 .
It is a cyclic number.
It is not a de Polignac number, because 134351444142469 - 213 = 134351444134277 is a prime.
It is a super-2 number, since 2×1343514441424692 (a number of 29 digits) contains 22 as substring.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (134351444142479) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 67175722071234 + 67175722071235.
It is an arithmetic number, because the mean of its divisors is an integer number (67175722071235).
Almost surely, 2134351444142469 is an apocalyptic number.
It is an amenable number.
134351444142469 is a deficient number, since it is larger than the sum of its proper divisors (1).
134351444142469 is an equidigital number, since it uses as much as digits as its factorization.
134351444142469 is an evil number, because the sum of its binary digits is even.
The product of its digits is 19906560, while the sum is 55.
The spelling of 134351444142469 in words is "one hundred thirty-four trillion, three hundred fifty-one billion, four hundred forty-four million, one hundred forty-two thousand, four hundred sixty-nine".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.093 sec. • engine limits •