Base | Representation |
---|---|
bin | 111110011100110011… |
… | …0101010001000010101 |
3 | 110211011101102021221002 |
4 | 1330321212222020111 |
5 | 4144124231442100 |
6 | 141335351433045 |
7 | 12455244526403 |
oct | 1747146521025 |
9 | 424141367832 |
10 | 134110421525 |
11 | 5196a922713 |
12 | 21ba9385785 |
13 | c853648412 |
14 | 66c3364473 |
15 | 374db4b2d5 |
hex | 1f399aa215 |
134110421525 has 24 divisors (see below), whose sum is σ = 176103442944. Its totient is φ = 100963296000.
The previous prime is 134110421461. The next prime is 134110421527. The reversal of 134110421525 is 525124011431.
It is a happy number.
It is not a de Polignac number, because 134110421525 - 26 = 134110421461 is a prime.
It is a super-2 number, since 2×1341104215252 (a number of 23 digits) contains 22 as substring.
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (134110421527) 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 23 ways as a sum of consecutive naturals, for example, 3871934 + ... + 3906416.
It is an arithmetic number, because the mean of its divisors is an integer number (7337643456).
Almost surely, 2134110421525 is an apocalyptic number.
It is an amenable number.
134110421525 is a deficient number, since it is larger than the sum of its proper divisors (41993021419).
134110421525 is a wasteful number, since it uses less digits than its factorization.
134110421525 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 43661 (or 43656 counting only the distinct ones).
The product of its (nonzero) digits is 4800, while the sum is 29.
Adding to 134110421525 its reverse (525124011431), we get a palindrome (659234432956).
The spelling of 134110421525 in words is "one hundred thirty-four billion, one hundred ten million, four hundred twenty-one thousand, five hundred twenty-five".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •