Base | Representation |
---|---|
bin | 11110100110101111001000… |
… | …011101101001111010111111 |
3 | 122122120221202102120121102022 |
4 | 132212233020131221322333 |
5 | 120120320121341301211 |
6 | 1154135531112550355 |
7 | 40231525220203646 |
oct | 3646571035517277 |
9 | 578527672517368 |
10 | 134603343306431 |
11 | 39985a59215a5a |
12 | 1311b0433b23bb |
13 | 5a1506b873c3c |
14 | 2534b9d7d235d |
15 | 108651db7abdb |
hex | 7a6bc8769ebf |
134603343306431 has 8 divisors (see below), whose sum is σ = 136350277620480. Its totient is φ = 132857486355672.
The previous prime is 134603343306401. The next prime is 134603343306541.
It is a happy number.
134603343306431 is nontrivially palindromic in base 10.
It is a sphenic number, since it is the product of 3 distinct primes.
It is a cyclic number.
It is not a de Polignac number, because 134603343306431 - 210 = 134603343305407 is a prime.
It is a super-2 number, since 2×1346033433064312 (a number of 29 digits) contains 22 as substring.
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (134603343306401) by changing a digit.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 269089325 + ... + 269589078.
It is an arithmetic number, because the mean of its divisors is an integer number (17043784702560).
Almost surely, 2134603343306431 is an apocalyptic number.
134603343306431 is a deficient number, since it is larger than the sum of its proper divisors (1746934314049).
134603343306431 is an equidigital number, since it uses as much as digits as its factorization.
134603343306431 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 538681645.
The product of its (nonzero) digits is 1679616, while the sum is 44.
The spelling of 134603343306431 in words is "one hundred thirty-four trillion, six hundred three billion, three hundred forty-three million, three hundred six thousand, four hundred thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •