Base | Representation |
---|---|
bin | 10010100110001… |
… | …110010101100001 |
3 | 210202002202100221 |
4 | 102212032111201 |
5 | 1114333310311 |
6 | 50543243041 |
7 | 10506020245 |
oct | 2246162541 |
9 | 722082327 |
10 | 312010081 |
11 | 150137879 |
12 | 885a9481 |
13 | 4c844566 |
14 | 2d61c425 |
15 | 1c5d2671 |
hex | 1298e561 |
312010081 has 4 divisors (see below), whose sum is σ = 312087600. Its totient is φ = 311932564.
The previous prime is 312010073. The next prime is 312010087. The reversal of 312010081 is 180010213.
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.
It is a cyclic number.
It is not a de Polignac number, because 312010081 - 23 = 312010073 is a prime.
It is a super-2 number, since 2×3120100812 = 194700581291253122, which contains 22 as substring.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (312010087) 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, 32371 + ... + 40888.
It is an arithmetic number, because the mean of its divisors is an integer number (78021900).
Almost surely, 2312010081 is an apocalyptic number.
It is an amenable number.
312010081 is a deficient number, since it is larger than the sum of its proper divisors (77519).
312010081 is an equidigital number, since it uses as much as digits as its factorization.
312010081 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 77518.
The product of its (nonzero) digits is 48, while the sum is 16.
The square root of 312010081 is about 17663.8070924702. The cubic root of 312010081 is about 678.2495933965.
Adding to 312010081 its reverse (180010213), we get a palindrome (492020294).
The spelling of 312010081 in words is "three hundred twelve million, ten thousand, eighty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 1.114 sec. • engine limits •