Base | Representation |
---|---|
bin | 1011001110100111… |
… | …1011001110001101 |
3 | 21210001120202120000 |
4 | 2303221323032031 |
5 | 22133103042031 |
6 | 1215030514513 |
7 | 134456346645 |
oct | 26351731615 |
9 | 7701522500 |
10 | 3014112141 |
11 | 130742a077 |
12 | 701505a39 |
13 | 3905b5a11 |
14 | 20843b525 |
15 | 1299303e6 |
hex | b3a7b38d |
3014112141 has 20 divisors (see below), whose sum is σ = 4504285500. Its totient is φ = 2008639296.
The previous prime is 3014112107. The next prime is 3014112151. The reversal of 3014112141 is 1412114103.
It can be written as a sum of positive squares in 2 ways, for example, as 468506025 + 2545606116 = 21645^2 + 50454^2 .
It is not a de Polignac number, because 3014112141 - 210 = 3014111117 is a prime.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (3014112151) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written in 19 ways as a sum of consecutive naturals, for example, 273975 + ... + 284763.
It is an arithmetic number, because the mean of its divisors is an integer number (225214275).
Almost surely, 23014112141 is an apocalyptic number.
It is an amenable number.
3014112141 is a deficient number, since it is larger than the sum of its proper divisors (1490173359).
3014112141 is a wasteful number, since it uses less digits than its factorization.
3014112141 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 14250 (or 14241 counting only the distinct ones).
The product of its (nonzero) digits is 96, while the sum is 18.
The square root of 3014112141 is about 54900.9302380206. The cubic root of 3014112141 is about 1444.5075034467.
Adding to 3014112141 its reverse (1412114103), we get a palindrome (4426226244).
The spelling of 3014112141 in words is "three billion, fourteen million, one hundred twelve thousand, one hundred forty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.081 sec. • engine limits •