Base | Representation |
---|---|
bin | 10010010011010… |
… | …11001010100101 |
3 | 101200220012000000 |
4 | 21021223022211 |
5 | 303300443140 |
6 | 23122411513 |
7 | 3542664243 |
oct | 1111531245 |
9 | 350805000 |
10 | 153531045 |
11 | 79734168 |
12 | 43500b99 |
13 | 25a67195 |
14 | 16567793 |
15 | d72aa30 |
hex | 926b2a5 |
153531045 has 56 divisors (see below), whose sum is σ = 280498776. Its totient is φ = 80621568.
The previous prime is 153531013. The next prime is 153531047. The reversal of 153531045 is 540135351.
It can be written as a sum of positive squares in 4 ways, for example, as 64738116 + 88792929 = 8046^2 + 9423^2 .
It is not a de Polignac number, because 153531045 - 25 = 153531013 is a prime.
It is a Harshad number since it is a multiple of its sum of digits (27).
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (153531047) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (13) of ones.
It is a polite number, since it can be written in 55 ways as a sum of consecutive naturals, for example, 265797 + ... + 266373.
Almost surely, 2153531045 is an apocalyptic number.
153531045 is a gapful number since it is divisible by the number (15) formed by its first and last digit.
It is an amenable number.
153531045 is a deficient number, since it is larger than the sum of its proper divisors (126967731).
153531045 is an frugal number, since it uses more digits than its factorization.
153531045 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 673 (or 658 counting only the distinct ones).
The product of its (nonzero) digits is 4500, while the sum is 27.
The square root of 153531045 is about 12390.7645042588. The cubic root of 153531045 is about 535.4662078810.
Adding to 153531045 its reverse (540135351), we get a palindrome (693666396).
The spelling of 153531045 in words is "one hundred fifty-three million, five hundred thirty-one thousand, forty-five".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •