Base | Representation |
---|---|
bin | 10010010011101… |
… | …100011000100101 |
3 | 210101221221220121 |
4 | 102103230120211 |
5 | 1112112334141 |
6 | 50251201541 |
7 | 10416516052 |
oct | 2223543045 |
9 | 711857817 |
10 | 307152421 |
11 | 14841a184 |
12 | 86a462b1 |
13 | 4b8334c4 |
14 | 2cb16029 |
15 | 1be731d1 |
hex | 124ec625 |
307152421 has 4 divisors (see below), whose sum is σ = 309571072. Its totient is φ = 304733772.
The previous prime is 307152401. The next prime is 307152431. The reversal of 307152421 is 124251703.
It is a happy number.
It is a semiprime because it is the product of two primes, and also a Blum integer, because the two primes are equal to 3 mod 4.
It is a cyclic number.
It is not a de Polignac number, because 307152421 - 217 = 307021349 is a prime.
It is a super-2 number, since 2×3071524212 = 188685219452322482, which contains 22 as substring.
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (307152401) 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 3 ways as a sum of consecutive naturals, for example, 1209135 + ... + 1209388.
It is an arithmetic number, because the mean of its divisors is an integer number (77392768).
Almost surely, 2307152421 is an apocalyptic number.
It is an amenable number.
307152421 is a deficient number, since it is larger than the sum of its proper divisors (2418651).
307152421 is a wasteful number, since it uses less digits than its factorization.
307152421 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 2418650.
The product of its (nonzero) digits is 1680, while the sum is 25.
The square root of 307152421 is about 17525.7644911713. The cubic root of 307152421 is about 674.7112956488.
The spelling of 307152421 in words is "three hundred seven million, one hundred fifty-two thousand, four hundred twenty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.064 sec. • engine limits •