Base | Representation |
---|---|
bin | 10010001111100… |
… | …10000010110011 |
3 | 101122221222110102 |
4 | 21013302002303 |
5 | 303134104211 |
6 | 23104023015 |
7 | 3535526660 |
oct | 1107620263 |
9 | 348858412 |
10 | 153034931 |
11 | 79425455 |
12 | 43301a6b |
13 | 2592241a |
14 | 16478a67 |
15 | d67da3b |
hex | 91f20b3 |
153034931 has 8 divisors (see below), whose sum is σ = 176532480. Its totient is φ = 129946248.
The previous prime is 153034913. The next prime is 153034991. The reversal of 153034931 is 139430351.
It is a sphenic number, since it is the product of 3 distinct primes.
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-153034931 is a prime.
It is a super-2 number, since 2×1530349312 = 46839380212349522, which contains 22 as substring.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 153034894 and 153034903.
It is not an unprimeable number, because it can be changed into a prime (153034991) 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 7 ways as a sum of consecutive naturals, for example, 101411 + ... + 102908.
It is an arithmetic number, because the mean of its divisors is an integer number (22066560).
Almost surely, 2153034931 is an apocalyptic number.
153034931 is a deficient number, since it is larger than the sum of its proper divisors (23497549).
153034931 is a wasteful number, since it uses less digits than its factorization.
153034931 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 204433.
The product of its (nonzero) digits is 4860, while the sum is 29.
The square root of 153034931 is about 12370.7287982560. The cubic root of 153034931 is about 534.8888242507. Note that the first 4 decimals are identical.
The spelling of 153034931 in words is "one hundred fifty-three million, thirty-four thousand, nine hundred thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •