Base | Representation |
---|---|
bin | 111110111000100100… |
… | …1100000110001111001 |
3 | 110220120022220212221020 |
4 | 1331301021200301321 |
5 | 4203031312231040 |
6 | 142012041133053 |
7 | 12520321440306 |
oct | 1756111406171 |
9 | 426508825836 |
10 | 135042305145 |
11 | 522a8951670 |
12 | 2220948a189 |
13 | c971726247 |
14 | 67710200ad |
15 | 37a5874cd0 |
hex | 1f71260c79 |
135042305145 has 64 divisors (see below), whose sum is σ = 241457172480. Its totient is φ = 63887155200.
The previous prime is 135042305129. The next prime is 135042305171. The reversal of 135042305145 is 541503240531.
It is not a de Polignac number, because 135042305145 - 24 = 135042305129 is a prime.
It is a Harshad number since it is a multiple of its sum of digits (33).
It is an unprimeable number.
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 63 ways as a sum of consecutive naturals, for example, 2540601 + ... + 2593209.
It is an arithmetic number, because the mean of its divisors is an integer number (3772768320).
Almost surely, 2135042305145 is an apocalyptic number.
135042305145 is a gapful number since it is divisible by the number (15) formed by its first and last digit.
It is an amenable number.
135042305145 is a deficient number, since it is larger than the sum of its proper divisors (106414867335).
135042305145 is a wasteful number, since it uses less digits than its factorization.
135042305145 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 53006.
The product of its (nonzero) digits is 36000, while the sum is 33.
Adding to 135042305145 its reverse (541503240531), we get a palindrome (676545545676).
The spelling of 135042305145 in words is "one hundred thirty-five billion, forty-two million, three hundred five thousand, one hundred forty-five".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •