Base | Representation |
---|---|
bin | 11110011111100110110101… |
… | …111101100001001100100101 |
3 | 122120212010010220021012210221 |
4 | 132133212311331201030211 |
5 | 120034303224043323303 |
6 | 1153122503133244341 |
7 | 40151242145115241 |
oct | 3637466575411445 |
9 | 576763126235727 |
10 | 134113406620453 |
11 | 398071a3787307 |
12 | 130600b06336b1 |
13 | 59aaabc580b60 |
14 | 25191a2cd3421 |
15 | 10788e67604bd |
hex | 79f9b5f61325 |
134113406620453 has 8 divisors (see below), whose sum is σ = 144429913152000. Its totient is φ = 123796913037168.
The previous prime is 134113406620397. The next prime is 134113406620463. The reversal of 134113406620453 is 354026604311431.
It is a sphenic number, since it is the product of 3 distinct primes.
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-134113406620453 is a prime.
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (134113406620463) 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, 35027328 + ... + 38667046.
It is an arithmetic number, because the mean of its divisors is an integer number (18053739144000).
Almost surely, 2134113406620453 is an apocalyptic number.
134113406620453 is a gapful number since it is divisible by the number (13) formed by its first and last digit.
It is an amenable number.
134113406620453 is a deficient number, since it is larger than the sum of its proper divisors (10316506531547).
134113406620453 is a wasteful number, since it uses less digits than its factorization.
134113406620453 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 6474131.
The product of its (nonzero) digits is 622080, while the sum is 43.
The spelling of 134113406620453 in words is "one hundred thirty-four trillion, one hundred thirteen billion, four hundred six million, six hundred twenty thousand, four hundred fifty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.075 sec. • engine limits •