Base | Representation |
---|---|
bin | 10010010001010… |
… | …11111011011111 |
3 | 101200102000200220 |
4 | 21020223323133 |
5 | 303214201111 |
6 | 23113052423 |
7 | 3540535143 |
oct | 1110537337 |
9 | 350360626 |
10 | 153272031 |
11 | 79577600 |
12 | 433b7113 |
13 | 259a6313 |
14 | 164db223 |
15 | d6c8e06 |
hex | 922bedf |
153272031 has 48 divisors (see below), whose sum is σ = 240549120. Its totient is φ = 86486400.
The previous prime is 153272027. The next prime is 153272039. The reversal of 153272031 is 130272351.
It is not a de Polignac number, because 153272031 - 22 = 153272027 is a prime.
It is a super-2 number, since 2×1532720312 = 46984630973729922, which contains 22 as substring.
It is a junction number, because it is equal to n+sod(n) for n = 153271992 and 153272010.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (153272039) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (17) of ones.
It is a polite number, since it can be written in 47 ways as a sum of consecutive naturals, for example, 489531 + ... + 489843.
It is an arithmetic number, because the mean of its divisors is an integer number (5011440).
Almost surely, 2153272031 is an apocalyptic number.
153272031 is a gapful number since it is divisible by the number (11) formed by its first and last digit.
153272031 is a deficient number, since it is larger than the sum of its proper divisors (87277089).
153272031 is a wasteful number, since it uses less digits than its factorization.
153272031 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 428 (or 417 counting only the distinct ones).
The product of its (nonzero) digits is 1260, while the sum is 24.
The square root of 153272031 is about 12380.3081948714. The cubic root of 153272031 is about 535.1649196052.
The spelling of 153272031 in words is "one hundred fifty-three million, two hundred seventy-two thousand, thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •