Base | Representation |
---|---|
bin | 1011100110011100… |
… | …0001010111001011 |
3 | 22001000120022100121 |
4 | 2321213001113023 |
5 | 22334141423110 |
6 | 1233000044111 |
7 | 140111453320 |
oct | 27147012713 |
9 | 8030508317 |
10 | 3114014155 |
11 | 1358863a1a |
12 | 72aa63637 |
13 | 3a81c3a35 |
14 | 217804b47 |
15 | 1335b5cda |
hex | b99c15cb |
3114014155 has 8 divisors (see below), whose sum is σ = 4270648032. Its totient is φ = 2135323968.
The previous prime is 3114014153. The next prime is 3114014161. The reversal of 3114014155 is 5514104113.
It is a sphenic number, since it is the product of 3 distinct primes.
It is a cyclic number.
It is not a de Polignac number, because 3114014155 - 21 = 3114014153 is a prime.
It is not an unprimeable number, because it can be changed into a prime (3114014153) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (17) of ones.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 44485882 + ... + 44485951.
It is an arithmetic number, because the mean of its divisors is an integer number (533831004).
Almost surely, 23114014155 is an apocalyptic number.
3114014155 is a gapful number since it is divisible by the number (35) formed by its first and last digit.
3114014155 is a deficient number, since it is larger than the sum of its proper divisors (1156633877).
3114014155 is an equidigital number, since it uses as much as digits as its factorization.
3114014155 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 88971845.
The product of its (nonzero) digits is 1200, while the sum is 25.
The square root of 3114014155 is about 55803.3525426564. The cubic root of 3114014155 is about 1460.2936412880.
Adding to 3114014155 its reverse (5514104113), we get a palindrome (8628118268).
The spelling of 3114014155 in words is "three billion, one hundred fourteen million, fourteen thousand, one hundred fifty-five".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.083 sec. • engine limits •