Base | Representation |
---|---|
bin | 111010000011… |
… | …0101111000101 |
3 | 2010021022202010 |
4 | 1310012233011 |
5 | 30242430133 |
6 | 3004204433 |
7 | 516463356 |
oct | 164065705 |
9 | 63238663 |
10 | 30436293 |
11 | 161a9268 |
12 | a239719 |
13 | 63c8754 |
14 | 4083d2d |
15 | 2a13263 |
hex | 1d06bc5 |
30436293 has 8 divisors (see below), whose sum is σ = 40792768. Its totient is φ = 20185344.
The previous prime is 30436279. The next prime is 30436297. The reversal of 30436293 is 39263403.
It is a sphenic number, since it is the product of 3 distinct primes.
It is not a de Polignac number, because 30436293 - 26 = 30436229 is a prime.
It is a Duffinian number.
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 30436293.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (30436297) 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, 25705 + ... + 26862.
It is an arithmetic number, because the mean of its divisors is an integer number (5099096).
Almost surely, 230436293 is an apocalyptic number.
It is an amenable number.
30436293 is a deficient number, since it is larger than the sum of its proper divisors (10356475).
30436293 is a wasteful number, since it uses less digits than its factorization.
30436293 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 52763.
The product of its (nonzero) digits is 11664, while the sum is 30.
The square root of 30436293 is about 5516.9097328124. The cubic root of 30436293 is about 312.2223000712. Note that the first 3 decimals are identical.
Adding to 30436293 its reverse (39263403), we get a palindrome (69699696).
The spelling of 30436293 in words is "thirty million, four hundred thirty-six thousand, two hundred ninety-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.067 sec. • engine limits •