Base | Representation |
---|---|
bin | 11110100010101100111101… |
… | …101001011110011101001001 |
3 | 122121121110020102000000110122 |
4 | 132202230331221132131021 |
5 | 120101244411413341400 |
6 | 1153404324124153025 |
7 | 40202512612011305 |
oct | 3642547551363511 |
9 | 577543212000418 |
10 | 134326136465225 |
11 | 39889438183281 |
12 | 1309537b398775 |
13 | 59c4b91cc3353 |
14 | 25255c38d8d05 |
15 | 107e1e7570685 |
hex | 7a2b3da5e749 |
134326136465225 has 6 divisors (see below), whose sum is σ = 166564409216910. Its totient is φ = 107460909172160.
The previous prime is 134326136465179. The next prime is 134326136465231. The reversal of 134326136465225 is 522564631623431.
It can be written as a sum of positive squares in 3 ways, for example, as 2678302448704 + 131647834016521 = 1636552^2 + 11473789^2 .
It is not a de Polignac number, because 134326136465225 - 212 = 134326136461129 is a prime.
It is a super-3 number, since 3×1343261364652253 (a number of 43 digits) contains 333 as substring.
It is an unprimeable number.
It is a polite number, since it can be written in 5 ways as a sum of consecutive naturals, for example, 2686522729280 + ... + 2686522729329.
It is an arithmetic number, because the mean of its divisors is an integer number (27760734869485).
Almost surely, 2134326136465225 is an apocalyptic number.
It is an amenable number.
134326136465225 is a deficient number, since it is larger than the sum of its proper divisors (32238272751685).
134326136465225 is an equidigital number, since it uses as much as digits as its factorization.
134326136465225 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 5373045458619 (or 5373045458614 counting only the distinct ones).
The product of its digits is 18662400, while the sum is 53.
The spelling of 134326136465225 in words is "one hundred thirty-four trillion, three hundred twenty-six billion, one hundred thirty-six million, four hundred sixty-five thousand, two hundred twenty-five".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •