Base | Representation |
---|---|
bin | 11110011110001001011100… |
… | …011111111000110110110110 |
3 | 122120111112021211222211221111 |
4 | 132132021130133320312312 |
5 | 120031132333041324024 |
6 | 1153004440021505234 |
7 | 40141062036102415 |
oct | 3636113437706666 |
9 | 576445254884844 |
10 | 134013121433014 |
11 | 3977871137470a |
12 | 1304478327221a |
13 | 59a14c995b865 |
14 | 25143ac03747c |
15 | 1075ec7490a94 |
hex | 79e25c7f8db6 |
134013121433014 has 8 divisors (see below), whose sum is σ = 207504188025408. Its totient is φ = 64845058757880.
The previous prime is 134013121432963. The next prime is 134013121433017. The reversal of 134013121433014 is 410334121310431.
It is a sphenic number, since it is the product of 3 distinct primes.
It is a Harshad number since it is a multiple of its sum of digits (31).
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (134013121433017) 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 3 ways as a sum of consecutive naturals, for example, 1080750979237 + ... + 1080750979360.
It is an arithmetic number, because the mean of its divisors is an integer number (25938023503176).
Almost surely, 2134013121433014 is an apocalyptic number.
134013121433014 is a deficient number, since it is larger than the sum of its proper divisors (73491066592394).
134013121433014 is a wasteful number, since it uses less digits than its factorization.
134013121433014 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 2161501958630.
The product of its (nonzero) digits is 10368, while the sum is 31.
Adding to 134013121433014 its reverse (410334121310431), we get a palindrome (544347242743445).
The spelling of 134013121433014 in words is "one hundred thirty-four trillion, thirteen billion, one hundred twenty-one million, four hundred thirty-three thousand, fourteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.067 sec. • engine limits •