Base | Representation |
---|---|
bin | 11110011110011101110100… |
… | …101001110001111111100001 |
3 | 122120120121202201020020012110 |
4 | 132132131310221301333201 |
5 | 120032012140342003001 |
6 | 1153022455111545533 |
7 | 40142465200534005 |
oct | 3636356451617741 |
9 | 576517681206173 |
10 | 134035001516001 |
11 | 39786a1a085923 |
12 | 13048a6a98b2a9 |
13 | 59a35a59b5621 |
14 | 2515485cc0705 |
15 | 10768582d33d6 |
hex | 79e774a71fe1 |
134035001516001 has 8 divisors (see below), whose sum is σ = 178777138770144. Its totient is φ = 89324765969600.
The previous prime is 134035001515993. The next prime is 134035001516047. The reversal of 134035001516001 is 100615100530431.
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 134035001516001 - 23 = 134035001515993 is a prime.
It is a self number, because there is not a number n which added to its sum of digits gives 134035001516001.
It is not an unprimeable number, because it can be changed into a prime (134035001516071) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (29) of ones.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 7975417131 + ... + 7975433936.
It is an arithmetic number, because the mean of its divisors is an integer number (22347142346268).
Almost surely, 2134035001516001 is an apocalyptic number.
It is an amenable number.
134035001516001 is a deficient number, since it is larger than the sum of its proper divisors (44742137254143).
134035001516001 is a wasteful number, since it uses less digits than its factorization.
134035001516001 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 15950853871.
The product of its (nonzero) digits is 5400, while the sum is 30.
The spelling of 134035001516001 in words is "one hundred thirty-four trillion, thirty-five billion, one million, five hundred sixteen thousand, one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.078 sec. • engine limits •