Base | Representation |
---|---|
bin | 111110011011000100… |
… | …0100101001110001011 |
3 | 110211000022212121111012 |
4 | 1330312020211032023 |
5 | 4144014331033301 |
6 | 141325511554135 |
7 | 12453636642263 |
oct | 1746610451613 |
9 | 424008777435 |
10 | 134052205451 |
11 | 5193aa8005a |
12 | 21b9198b94b |
13 | c844574438 |
14 | 66b972c7a3 |
15 | 374899bebb |
hex | 1f3622538b |
134052205451 has 8 divisors (see below), whose sum is σ = 134307051120. Its totient is φ = 133797484512.
The previous prime is 134052205381. The next prime is 134052205453. The reversal of 134052205451 is 154502250431.
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-134052205451 is a prime.
It is a super-2 number, since 2×1340522054512 (a number of 23 digits) contains 22 as substring.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (134052205453) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 2281721 + ... + 2339733.
It is an arithmetic number, because the mean of its divisors is an integer number (16788381390).
Almost surely, 2134052205451 is an apocalyptic number.
134052205451 is a deficient number, since it is larger than the sum of its proper divisors (254845669).
134052205451 is an equidigital number, since it uses as much as digits as its factorization.
134052205451 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 62365.
The product of its (nonzero) digits is 24000, while the sum is 32.
Adding to 134052205451 its reverse (154502250431), we get a palindrome (288554455882).
The spelling of 134052205451 in words is "one hundred thirty-four billion, fifty-two million, two hundred five thousand, four hundred fifty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.092 sec. • engine limits •