Base | Representation |
---|---|
bin | 10010010001000… |
… | …11010111101010 |
3 | 101200100020121100 |
4 | 21020203113222 |
5 | 303212040340 |
6 | 23112222230 |
7 | 3540331005 |
oct | 1110432752 |
9 | 350306540 |
10 | 153236970 |
11 | 79553227 |
12 | 4339a976 |
13 | 25993383 |
14 | 164cc53c |
15 | d6bd830 |
hex | 92235ea |
153236970 has 48 divisors (see below), whose sum is σ = 399219912. Its totient is φ = 40780800.
The previous prime is 153236969. The next prime is 153236977. The reversal of 153236970 is 79632351.
153236970 is a `hidden beast` number, since 1 + 532 + 36 + 97 + 0 = 666.
It can be written as a sum of positive squares in 4 ways, for example, as 137100681 + 16136289 = 11709^2 + 4017^2 .
It is a Smith number, since the sum of its digits (36) coincides with the sum of the digits of its prime factors.
It is not an unprimeable number, because it can be changed into a prime (153236977) 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 23 ways as a sum of consecutive naturals, for example, 52674 + ... + 55506.
Almost surely, 2153236970 is an apocalyptic number.
153236970 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
153236970 is an abundant number, since it is smaller than the sum of its proper divisors (245982942).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
153236970 is a wasteful number, since it uses less digits than its factorization.
153236970 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 3447 (or 3444 counting only the distinct ones).
The product of its (nonzero) digits is 34020, while the sum is 36.
The square root of 153236970 is about 12378.8921152097. The cubic root of 153236970 is about 535.1241101415.
The spelling of 153236970 in words is "one hundred fifty-three million, two hundred thirty-six thousand, nine hundred seventy".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •