Base | Representation |
---|---|
bin | 10010010010100… |
… | …111101110100001 |
3 | 210101102200011001 |
4 | 102102213232201 |
5 | 1112024334301 |
6 | 50241152001 |
7 | 10414235140 |
oct | 2222475641 |
9 | 711380131 |
10 | 306871201 |
11 | 14824796a |
12 | 8692b601 |
13 | 4b7654c0 |
14 | 2ca81757 |
15 | 1be19c01 |
hex | 124a7ba1 |
306871201 has 32 divisors (see below), whose sum is σ = 392677376. Its totient is φ = 233280000.
The previous prime is 306871193. The next prime is 306871211. The reversal of 306871201 is 102178603.
It is a 2-Lehmer number, since φ(306871201) divides (306871201-1)2.
It is a cyclic number.
It is a Carmichael number.
It is not a de Polignac number, because 306871201 - 23 = 306871193 is a prime.
It is a deceptive number, since it divides R306871200.
It is a self number, because there is not a number n which added to its sum of digits gives 306871201.
It is not an unprimeable number, because it can be changed into a prime (306871211) by changing a digit.
It is a polite number, since it can be written in 31 ways as a sum of consecutive naturals, for example, 510301 + ... + 510901.
It is an arithmetic number, because the mean of its divisors is an integer number (12271168).
It is a Poulet number, since it divides 2306871200-1.
Almost surely, 2306871201 is an apocalyptic number.
306871201 is a gapful number since it is divisible by the number (31) formed by its first and last digit.
It is an amenable number.
306871201 is a deficient number, since it is larger than the sum of its proper divisors (85806175).
306871201 is a wasteful number, since it uses less digits than its factorization.
306871201 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 833.
The product of its (nonzero) digits is 2016, while the sum is 28.
The square root of 306871201 is about 17517.7396087509. The cubic root of 306871201 is about 674.5053172977.
The spelling of 306871201 in words is "three hundred six million, eight hundred seventy-one thousand, two hundred one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.065 sec. • engine limits •