Base | Representation |
---|---|
bin | 111110101100111101… |
… | …0101011010110010110 |
3 | 110212120011111210002121 |
4 | 1331121322223112112 |
5 | 4201232022242220 |
6 | 141505235130154 |
7 | 12504546464551 |
oct | 1753172532626 |
9 | 425504453077 |
10 | 134652540310 |
11 | 52118937572 |
12 | 2211aa4395a |
13 | c90ba59572 |
14 | 6735361698 |
15 | 3781533eaa |
hex | 1f59eab596 |
134652540310 has 8 divisors (see below), whose sum is σ = 242374572576. Its totient is φ = 53861016120.
The previous prime is 134652540307. The next prime is 134652540311. The reversal of 134652540310 is 13045256431.
It is a sphenic number, since it is the product of 3 distinct primes.
It is a super-2 number, since 2×1346525403102 (a number of 23 digits) contains 22 as substring.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (134652540311) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (23) of ones.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 6732627006 + ... + 6732627025.
It is an arithmetic number, because the mean of its divisors is an integer number (30296821572).
Almost surely, 2134652540310 is an apocalyptic number.
134652540310 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
134652540310 is a deficient number, since it is larger than the sum of its proper divisors (107722032266).
134652540310 is a wasteful number, since it uses less digits than its factorization.
134652540310 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 13465254038.
The product of its (nonzero) digits is 43200, while the sum is 34.
Adding to 134652540310 its reverse (13045256431), we get a palindrome (147697796741).
The spelling of 134652540310 in words is "one hundred thirty-four billion, six hundred fifty-two million, five hundred forty thousand, three hundred ten".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.066 sec. • engine limits •