Base | Representation |
---|---|
bin | 10010001111100… |
… | …01000100100111 |
3 | 101122221210000000 |
4 | 21013301010213 |
5 | 303133442301 |
6 | 23103552343 |
7 | 3535512243 |
oct | 1107610447 |
9 | 348853000 |
10 | 153030951 |
11 | 79422467 |
12 | 432bb6b3 |
13 | 25920678 |
14 | 16477423 |
15 | d67c786 |
hex | 91f1127 |
153030951 has 32 divisors (see below), whose sum is σ = 231436800. Its totient is φ = 101167704.
The previous prime is 153030949. The next prime is 153030989. The reversal of 153030951 is 159030351.
It is not a de Polignac number, because 153030951 - 21 = 153030949 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 (153020951) 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 31 ways as a sum of consecutive naturals, for example, 365020 + ... + 365438.
It is an arithmetic number, because the mean of its divisors is an integer number (7232400).
Almost surely, 2153030951 is an apocalyptic number.
153030951 is a deficient number, since it is larger than the sum of its proper divisors (78405849).
153030951 is an frugal number, since it uses more digits than its factorization.
153030951 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 607 (or 589 counting only the distinct ones).
The product of its (nonzero) digits is 2025, while the sum is 27.
The square root of 153030951 is about 12370.5679336076. The cubic root of 153030951 is about 534.8841872354.
The spelling of 153030951 in words is "one hundred fifty-three million, thirty thousand, nine hundred fifty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •