Base | Representation |
---|---|
bin | 1011101100111100… |
… | …0111000011000101 |
3 | 22002220220121002001 |
4 | 2323033013003011 |
5 | 22413133103141 |
6 | 1235412545301 |
7 | 140562420160 |
oct | 27317070305 |
9 | 8086817061 |
10 | 3141300421 |
11 | 1372200556 |
12 | 738022231 |
13 | 3b0a5875c |
14 | 21b2a8ad7 |
15 | 135ba5a31 |
hex | bb3c70c5 |
3141300421 has 4 divisors (see below), whose sum is σ = 3590057632. Its totient is φ = 2692543212.
The previous prime is 3141300389. The next prime is 3141300497. The reversal of 3141300421 is 1240031413.
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 3141300421 - 25 = 3141300389 is a prime.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (3141300121) 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, 224378595 + ... + 224378608.
It is an arithmetic number, because the mean of its divisors is an integer number (897514408).
Almost surely, 23141300421 is an apocalyptic number.
It is an amenable number.
3141300421 is a deficient number, since it is larger than the sum of its proper divisors (448757211).
3141300421 is an equidigital number, since it uses as much as digits as its factorization.
3141300421 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 448757210.
The product of its (nonzero) digits is 288, while the sum is 19.
The square root of 3141300421 is about 56047.3052072979. The cubic root of 3141300421 is about 1464.5464737859.
Adding to 3141300421 its reverse (1240031413), we get a palindrome (4381331834).
The spelling of 3141300421 in words is "three billion, one hundred forty-one million, three hundred thousand, four hundred twenty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •