Base | Representation |
---|---|
bin | 111110100110111100… |
… | …0000010100110001000 |
3 | 110212001002101012202122 |
4 | 1331031320002212020 |
5 | 4200323313210004 |
6 | 141433221150412 |
7 | 12466544404424 |
oct | 1751570024610 |
9 | 425032335678 |
10 | 134450522504 |
11 | 520248a6601 |
12 | 2208325b408 |
13 | c8a8c469bc |
14 | 67165b5b84 |
15 | 376d92bcbe |
hex | 1f4de02988 |
134450522504 has 16 divisors (see below), whose sum is σ = 252463839120. Its totient is φ = 67126832080.
The previous prime is 134450522497. The next prime is 134450522509. The reversal of 134450522504 is 405225054431.
134450522504 is digitally balanced in base 3, because in such base it contains all the possibile digits an equal number of times.
It is a super-2 number, since 2×1344505225042 (a number of 23 digits) contains 22 as substring.
It is not an unprimeable number, because it can be changed into a prime (134450522509) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (17) of ones.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 12297842 + ... + 12308769.
It is an arithmetic number, because the mean of its divisors is an integer number (15778989945).
Almost surely, 2134450522504 is an apocalyptic number.
It is an amenable number.
134450522504 is a deficient number, since it is larger than the sum of its proper divisors (118013316616).
134450522504 is a wasteful number, since it uses less digits than its factorization.
134450522504 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 24607300 (or 24607296 counting only the distinct ones).
The product of its (nonzero) digits is 96000, while the sum is 35.
Adding to 134450522504 its reverse (405225054431), we get a palindrome (539675576935).
The spelling of 134450522504 in words is "one hundred thirty-four billion, four hundred fifty million, five hundred twenty-two thousand, five hundred four".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.080 sec. • engine limits •