Base | Representation |
---|---|
bin | 111010000011… |
… | …0010000001001 |
3 | 2010021020000210 |
4 | 1310012100021 |
5 | 30242344223 |
6 | 3004151333 |
7 | 516454530 |
oct | 164062011 |
9 | 63236023 |
10 | 30434313 |
11 | 161a7828 |
12 | a238549 |
13 | 63c7890 |
14 | 4083317 |
15 | 2a12893 |
hex | 1d06409 |
30434313 has 64 divisors (see below), whose sum is σ = 53932032. Its totient is φ = 14826240.
The previous prime is 30434309. The next prime is 30434317. The reversal of 30434313 is 31343403.
It is an interprime number because it is at equal distance from previous prime (30434309) and next prime (30434317).
It is not a de Polignac number, because 30434313 - 22 = 30434309 is a prime.
It is a Harshad number since it is a multiple of its sum of digits (21).
It is a Curzon number.
It is a self number, because there is not a number n which added to its sum of digits gives 30434313.
It is not an unprimeable number, because it can be changed into a prime (30434317) by changing a digit.
It is a polite number, since it can be written in 63 ways as a sum of consecutive naturals, for example, 232258 + ... + 232388.
It is an arithmetic number, because the mean of its divisors is an integer number (842688).
Almost surely, 230434313 is an apocalyptic number.
It is an amenable number.
30434313 is a deficient number, since it is larger than the sum of its proper divisors (23497719).
30434313 is a wasteful number, since it uses less digits than its factorization.
30434313 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 214.
The product of its (nonzero) digits is 1296, while the sum is 21.
The square root of 30434313 is about 5516.7302816070. The cubic root of 30434313 is about 312.2155294968.
30434313 divided by its sum of digits (21) gives a triangular number (1449253 = T1702).
Adding to 30434313 its reverse (31343403), we get a palindrome (61777716).
The spelling of 30434313 in words is "thirty million, four hundred thirty-four thousand, three hundred thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •