Base | Representation |
---|---|
bin | 10010010000111… |
… | …110101100001001 |
3 | 210100121210222112 |
4 | 102100332230021 |
5 | 1111422102334 |
6 | 50224032105 |
7 | 10410463622 |
oct | 2220765411 |
9 | 710553875 |
10 | 306440969 |
11 | 147a836aa |
12 | 86762635 |
13 | 4b644723 |
14 | 2c9aca49 |
15 | 1bd824ce |
hex | 1243eb09 |
306440969 has 4 divisors (see below), whose sum is σ = 309475140. Its totient is φ = 303406800.
The previous prime is 306440957. The next prime is 306440977. The reversal of 306440969 is 969044603.
It is a semiprime because it is the product of two primes.
It can be written as a sum of positive squares in 2 ways, for example, as 297217600 + 9223369 = 17240^2 + 3037^2 .
It is a cyclic number.
It is not a de Polignac number, because 306440969 - 212 = 306436873 is a prime.
It is a super-2 number, since 2×3064409692 = 187812134963317922, which contains 22 as substring.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (306440909) 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, 1516934 + ... + 1517135.
It is an arithmetic number, because the mean of its divisors is an integer number (77368785).
Almost surely, 2306440969 is an apocalyptic number.
It is an amenable number.
306440969 is a deficient number, since it is larger than the sum of its proper divisors (3034171).
306440969 is a wasteful number, since it uses less digits than its factorization.
306440969 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 3034170.
The product of its (nonzero) digits is 139968, while the sum is 41.
The square root of 306440969 is about 17505.4554068153. The cubic root of 306440969 is about 674.1899520965.
The spelling of 306440969 in words is "three hundred six million, four hundred forty thousand, nine hundred sixty-nine".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •