Base | Representation |
---|---|
bin | 11110011110011011011010… |
… | …011100001001011000000101 |
3 | 122120120101002101211112011022 |
4 | 132132123122130021120011 |
5 | 120031441341022004001 |
6 | 1153021350245520525 |
7 | 40142344113251624 |
oct | 3636333234113005 |
9 | 576511071745138 |
10 | 134032414250501 |
11 | 39785911698a78 |
12 | 13048468413145 |
13 | 59a3282980ab0 |
14 | 25152bc4356bb |
15 | 10767560bb11b |
hex | 79e6da709605 |
134032414250501 has 8 divisors (see below), whose sum is σ = 144342690207744. Its totient is φ = 123722151185520.
The previous prime is 134032414250479. The next prime is 134032414250513. The reversal of 134032414250501 is 105052414230431.
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-134032414250501 is a prime.
It is a Duffinian number.
It is a Curzon number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (134032414250201) 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, 36519740 + ... + 40021946.
It is an arithmetic number, because the mean of its divisors is an integer number (18042836275968).
Almost surely, 2134032414250501 is an apocalyptic number.
It is an amenable number.
134032414250501 is a deficient number, since it is larger than the sum of its proper divisors (10310275957243).
134032414250501 is a wasteful number, since it uses less digits than its factorization.
134032414250501 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 6446131.
The product of its (nonzero) digits is 57600, while the sum is 35.
Adding to 134032414250501 its reverse (105052414230431), we get a palindrome (239084828480932).
The spelling of 134032414250501 in words is "one hundred thirty-four trillion, thirty-two billion, four hundred fourteen million, two hundred fifty thousand, five hundred one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.096 sec. • engine limits •