Base | Representation |
---|---|
bin | 10010010010101… |
… | …111000001000101 |
3 | 210101111012002222 |
4 | 102102233001011 |
5 | 1112031313221 |
6 | 50241542125 |
7 | 10414421165 |
oct | 2222570105 |
9 | 711435088 |
10 | 306901061 |
11 | 148268345 |
12 | 86944945 |
13 | 4b775c7c |
14 | 2ca8c5a5 |
15 | 1be239ab |
hex | 124af045 |
306901061 has 4 divisors (see below), whose sum is σ = 306943692. Its totient is φ = 306858432.
The previous prime is 306901039. The next prime is 306901081. The reversal of 306901061 is 160109603.
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 48302500 + 258598561 = 6950^2 + 16081^2 .
It is a cyclic number.
It is not a de Polignac number, because 306901061 - 226 = 239792197 is a prime.
It is a super-2 number, since 2×3069010612 = 188376522485851442, which contains 22 as substring.
It is a Duffinian number.
It is a self number, because there is not a number n which added to its sum of digits gives 306901061.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (306901081) 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, 7556 + ... + 25901.
It is an arithmetic number, because the mean of its divisors is an integer number (76735923).
Almost surely, 2306901061 is an apocalyptic number.
It is an amenable number.
306901061 is a deficient number, since it is larger than the sum of its proper divisors (42631).
306901061 is an equidigital number, since it uses as much as digits as its factorization.
306901061 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 42630.
The product of its (nonzero) digits is 972, while the sum is 26.
The square root of 306901061 is about 17518.5918669281. The cubic root of 306901061 is about 674.5271940932.
The spelling of 306901061 in words is "three hundred six million, nine hundred one thousand, sixty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •