Base | Representation |
---|---|
bin | 10010001111010… |
… | …01100100010011 |
3 | 101122220012211111 |
4 | 21013221210103 |
5 | 303132001321 |
6 | 23103154151 |
7 | 3535323520 |
oct | 1107514423 |
9 | 348805744 |
10 | 153000211 |
11 | 79401361 |
12 | 432a5957 |
13 | 2590c690 |
14 | 1646a147 |
15 | d6735e1 |
hex | 91e9913 |
153000211 has 8 divisors (see below), whose sum is σ = 188308064. Its totient is φ = 121055040.
The previous prime is 153000193. The next prime is 153000251. The reversal of 153000211 is 112000351.
It is a sphenic number, since it is the product of 3 distinct primes.
It is a cyclic number.
It is not a de Polignac number, because 153000211 - 27 = 153000083 is a prime.
It is a Harshad number since it is a multiple of its sum of digits (13).
It is a junction number, because it is equal to n+sod(n) for n = 153000191 and 153000200.
It is not an unprimeable number, because it can be changed into a prime (153000251) 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, 840570 + ... + 840751.
It is an arithmetic number, because the mean of its divisors is an integer number (23538508).
Almost surely, 2153000211 is an apocalyptic number.
153000211 is a deficient number, since it is larger than the sum of its proper divisors (35307853).
153000211 is a wasteful number, since it uses less digits than its factorization.
153000211 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1681341.
The product of its (nonzero) digits is 30, while the sum is 13.
The square root of 153000211 is about 12369.3254060195. The cubic root of 153000211 is about 534.8483699908.
Adding to 153000211 its reverse (112000351), we get a palindrome (265000562).
The spelling of 153000211 in words is "one hundred fifty-three million, two hundred eleven", and thus it is an aban number.
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.084 sec. • engine limits •