Base | Representation |
---|---|
bin | 111100011110000… |
… | …111000010111101 |
3 | 2121201000021020021 |
4 | 330132013002331 |
5 | 4034204314031 |
6 | 244400452141 |
7 | 34066221106 |
oct | 7436070275 |
9 | 2551007207 |
10 | 1014526141 |
11 | 480745562 |
12 | 24391a051 |
13 | 132254c35 |
14 | 98a4d3ad |
15 | 5e100511 |
hex | 3c7870bd |
1014526141 has 4 divisors (see below), whose sum is σ = 1015226784. Its totient is φ = 1013825500.
The previous prime is 1014526129. The next prime is 1014526157. The reversal of 1014526141 is 1416254101.
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: 1416254101 = 367 ⋅3859003.
It is a cyclic number.
It is not a de Polignac number, because 1014526141 - 27 = 1014526013 is a prime.
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (1014526241) 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 3 ways as a sum of consecutive naturals, for example, 348145 + ... + 351046.
It is an arithmetic number, because the mean of its divisors is an integer number (253806696).
Almost surely, 21014526141 is an apocalyptic number.
It is an amenable number.
1014526141 is a deficient number, since it is larger than the sum of its proper divisors (700643).
1014526141 is an equidigital number, since it uses as much as digits as its factorization.
1014526141 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 700642.
The product of its (nonzero) digits is 960, while the sum is 25.
The square root of 1014526141 is about 31851.6269757135. The cubic root of 1014526141 is about 1004.8187889742.
The spelling of 1014526141 in words is "one billion, fourteen million, five hundred twenty-six thousand, one hundred forty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.077 sec. • engine limits •