Base | Representation |
---|---|
bin | 1011100010001101… |
… | …0010101010000001 |
3 | 21222210011021010201 |
4 | 2320203102222001 |
5 | 22320120243301 |
6 | 1231123325201 |
7 | 136504524520 |
oct | 27043225201 |
9 | 7883137121 |
10 | 3096259201 |
11 | 1349837402 |
12 | 724b20801 |
13 | 3a4618449 |
14 | 2153024b7 |
15 | 131c5a201 |
hex | b88d2a81 |
3096259201 has 4 divisors (see below), whose sum is σ = 3538581952. Its totient is φ = 2653936452.
The previous prime is 3096259193. The next prime is 3096259213. The reversal of 3096259201 is 1029526903.
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: 1029526903 = 14551 ⋅70753.
It is a cyclic number.
It is not a de Polignac number, because 3096259201 - 23 = 3096259193 is a prime.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (3096259291) 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, 221161365 + ... + 221161378.
It is an arithmetic number, because the mean of its divisors is an integer number (884645488).
Almost surely, 23096259201 is an apocalyptic number.
It is an amenable number.
3096259201 is a deficient number, since it is larger than the sum of its proper divisors (442322751).
3096259201 is an equidigital number, since it uses as much as digits as its factorization.
3096259201 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 442322750.
The product of its (nonzero) digits is 29160, while the sum is 37.
The square root of 3096259201 is about 55644.0401211127. The cubic root of 3096259201 is about 1457.5129988926.
The spelling of 3096259201 in words is "three billion, ninety-six million, two hundred fifty-nine thousand, two hundred one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.345 sec. • engine limits •