Base | Representation |
---|---|
bin | 1011101111000010… |
… | …1110110011010001 |
3 | 22010112111101000221 |
4 | 2323300232303101 |
5 | 22422412122001 |
6 | 1240325513041 |
7 | 141030345556 |
oct | 27360566321 |
9 | 8115441027 |
10 | 3150114001 |
11 | 1377180301 |
12 | 73ab72781 |
13 | 3b28232a8 |
14 | 21c520a2d |
15 | 1368471a1 |
hex | bbc2ecd1 |
3150114001 has 4 divisors (see below), whose sum is σ = 3151452852. Its totient is φ = 3148775152.
The previous prime is 3150113999. The next prime is 3150114007. The reversal of 3150114001 is 1004110513.
It is a semiprime because it is the product of two primes, and also an emirpimes, since its reverse is a distinct semiprime: 1004110513 = 7 ⋅143444359.
It can be written as a sum of positive squares in 2 ways, for example, as 1447726401 + 1702387600 = 38049^2 + 41260^2 .
It is a cyclic number.
It is not a de Polignac number, because 3150114001 - 21 = 3150113999 is a prime.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (3150114007) 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, 665890 + ... + 670603.
It is an arithmetic number, because the mean of its divisors is an integer number (787863213).
Almost surely, 23150114001 is an apocalyptic number.
It is an amenable number.
3150114001 is a deficient number, since it is larger than the sum of its proper divisors (1338851).
3150114001 is a wasteful number, since it uses less digits than its factorization.
3150114001 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 1338850.
The product of its (nonzero) digits is 60, while the sum is 16.
The square root of 3150114001 is about 56125.8763940484. The cubic root of 3150114001 is about 1465.9148926594.
Adding to 3150114001 its reverse (1004110513), we get a palindrome (4154224514).
The spelling of 3150114001 in words is "three billion, one hundred fifty million, one hundred fourteen thousand, one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.083 sec. • engine limits •