Base | Representation |
---|---|
bin | 1000011101000010010… |
… | …1110111111011110111 |
3 | 111212212120110201222220 |
4 | 2013100211313323313 |
5 | 4334414234311020 |
6 | 150415214053423 |
7 | 13331010316230 |
oct | 2072045677367 |
9 | 455776421886 |
10 | 145233510135 |
11 | 5665859182a |
12 | 241924aa273 |
13 | 10906c0b75c |
14 | 705a716087 |
15 | 3ba0401240 |
hex | 21d0977ef7 |
145233510135 has 64 divisors (see below), whose sum is σ = 288050079744. Its totient is φ = 60962918400.
The previous prime is 145233510127. The next prime is 145233510151. The reversal of 145233510135 is 531015332541.
It is not a de Polignac number, because 145233510135 - 23 = 145233510127 is a prime.
It is a super-2 number, since 2×1452335101352 (a number of 23 digits) contains 22 as substring.
It is a junction number, because it is equal to n+sod(n) for n = 145233510096 and 145233510105.
It is a congruent number.
It is an unprimeable number.
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 63 ways as a sum of consecutive naturals, for example, 919051 + ... + 1065420.
It is an arithmetic number, because the mean of its divisors is an integer number (4500782496).
Almost surely, 2145233510135 is an apocalyptic number.
145233510135 is a gapful number since it is divisible by the number (15) formed by its first and last digit.
145233510135 is a deficient number, since it is larger than the sum of its proper divisors (142816569609).
145233510135 is a wasteful number, since it uses less digits than its factorization.
145233510135 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1984544.
The product of its (nonzero) digits is 27000, while the sum is 33.
Adding to 145233510135 its reverse (531015332541), we get a palindrome (676248842676).
The spelling of 145233510135 in words is "one hundred forty-five billion, two hundred thirty-three million, five hundred ten thousand, one hundred thirty-five".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •