Base | Representation |
---|---|
bin | 111001100010… |
… | …0000111100111 |
3 | 2002202110110010 |
4 | 1303010013213 |
5 | 30210212211 |
6 | 2554301303 |
7 | 514246014 |
oct | 163040747 |
9 | 62673403 |
10 | 30163431 |
11 | 16032261 |
12 | a127833 |
13 | 63314ac |
14 | 401270b |
15 | 29ac4a6 |
hex | 1cc41e7 |
30163431 has 8 divisors (see below), whose sum is σ = 42334720. Its totient is φ = 19050552.
The previous prime is 30163379. The next prime is 30163433. The reversal of 30163431 is 13436103.
It is a sphenic number, since it is the product of 3 distinct primes.
It is not a de Polignac number, because 30163431 - 27 = 30163303 is a prime.
It is a super-2 number, since 2×301634312 = 1819665139383522, 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 = 30163398 and 30163407.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (30163433) 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, 264535 + ... + 264648.
It is an arithmetic number, because the mean of its divisors is an integer number (5291840).
Almost surely, 230163431 is an apocalyptic number.
30163431 is a deficient number, since it is larger than the sum of its proper divisors (12171289).
30163431 is a wasteful number, since it uses less digits than its factorization.
30163431 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 529205.
The product of its (nonzero) digits is 648, while the sum is 21.
The square root of 30163431 is about 5492.1244523408. The cubic root of 30163431 is about 311.2864714282.
Adding to 30163431 its reverse (13436103), we get a palindrome (43599534).
The spelling of 30163431 in words is "thirty million, one hundred sixty-three thousand, four hundred thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.080 sec. • engine limits •