Base | Representation |
---|---|
bin | 10011011011110… |
… | …10010011010111 |
3 | 102100202210102201 |
4 | 21231322103113 |
5 | 313213431411 |
6 | 24102145331 |
7 | 4016506540 |
oct | 1155722327 |
9 | 370683381 |
10 | 163030231 |
11 | 84032031 |
12 | 46722247 |
13 | 27a11ac0 |
14 | 1791b4c7 |
15 | e4a53c1 |
hex | 9b7a4d7 |
163030231 has 8 divisors (see below), whose sum is σ = 200652704. Its totient is φ = 128990880.
The previous prime is 163030223. The next prime is 163030237. The reversal of 163030231 is 132030361.
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 163030231 - 23 = 163030223 is a prime.
It is a super-2 number, since 2×1630302312 = 53157712439826722, which contains 22 as substring.
It is a junction number, because it is equal to n+sod(n) for n = 163030199 and 163030208.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (163030237) 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 7 ways as a sum of consecutive naturals, for example, 895680 + ... + 895861.
It is an arithmetic number, because the mean of its divisors is an integer number (25081588).
Almost surely, 2163030231 is an apocalyptic number.
163030231 is a deficient number, since it is larger than the sum of its proper divisors (37622473).
163030231 is a wasteful number, since it uses less digits than its factorization.
163030231 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1791561.
The product of its (nonzero) digits is 324, while the sum is 19.
The square root of 163030231 is about 12768.3292172469. The cubic root of 163030231 is about 546.2893256986.
Adding to 163030231 its reverse (132030361), we get a palindrome (295060592).
The spelling of 163030231 in words is "one hundred sixty-three million, thirty thousand, two hundred thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.076 sec. • engine limits •