Base | Representation |
---|---|
bin | 111001011011… |
… | …1001011011111 |
3 | 2002122202202011 |
4 | 1302313023133 |
5 | 30202013211 |
6 | 2553212051 |
7 | 513635341 |
oct | 162671337 |
9 | 62582664 |
10 | 30110431 |
11 | 15aa645a |
12 | a101027 |
13 | 6313330 |
14 | 3ddb291 |
15 | 299b921 |
hex | 1cb72df |
30110431 has 8 divisors (see below), whose sum is σ = 32472720. Its totient is φ = 27754752.
The previous prime is 30110411. The next prime is 30110453. The reversal of 30110431 is 13401103.
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 30110431 - 211 = 30108383 is a prime.
It is a super-2 number, since 2×301104312 = 1813276110011522, which contains 22 as substring.
It is a Harshad number since it is a multiple of its sum of digits (13).
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (30110411) 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, 12111 + ... + 14383.
It is an arithmetic number, because the mean of its divisors is an integer number (4059090).
Almost surely, 230110431 is an apocalyptic number.
30110431 is a deficient number, since it is larger than the sum of its proper divisors (2362289).
30110431 is a wasteful number, since it uses less digits than its factorization.
30110431 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 3305.
The product of its (nonzero) digits is 36, while the sum is 13.
The square root of 30110431 is about 5487.2972399898. The cubic root of 30110431 is about 311.1040446194.
Adding to 30110431 its reverse (13401103), we get a palindrome (43511534).
The spelling of 30110431 in words is "thirty million, one hundred ten thousand, four hundred thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.063 sec. • engine limits •