Base | Representation |
---|---|
bin | 10010010000111… |
… | …010111010000001 |
3 | 210100121000201121 |
4 | 102100322322001 |
5 | 1111421103343 |
6 | 50223432241 |
7 | 10410400504 |
oct | 2220727201 |
9 | 710530647 |
10 | 306425473 |
11 | 147a72aa2 |
12 | 86755681 |
13 | 4b63a663 |
14 | 2c9a713b |
15 | 1bd7caed |
hex | 1243ae81 |
306425473 has 4 divisors (see below), whose sum is σ = 308838400. Its totient is φ = 304012548.
The previous prime is 306425467. The next prime is 306425479. The reversal of 306425473 is 374524603.
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, and also an emirpimes, since its reverse is a distinct semiprime: 374524603 = 17 ⋅22030859.
It is an interprime number because it is at equal distance from previous prime (306425467) and next prime (306425479).
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-306425473 is a prime.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (306425479) by changing a digit.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 1206273 + ... + 1206526.
It is an arithmetic number, because the mean of its divisors is an integer number (77209600).
Almost surely, 2306425473 is an apocalyptic number.
It is an amenable number.
306425473 is a deficient number, since it is larger than the sum of its proper divisors (2412927).
306425473 is a wasteful number, since it uses less digits than its factorization.
306425473 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 2412926.
The product of its (nonzero) digits is 60480, while the sum is 34.
The square root of 306425473 is about 17505.0127963392. The cubic root of 306425473 is about 674.1785878375.
The spelling of 306425473 in words is "three hundred six million, four hundred twenty-five thousand, four hundred seventy-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.000 sec. • engine limits •