Base | Representation |
---|---|
bin | 1001001001001000101… |
… | …01110110101101110001 |
3 | 1010000212010012101202002 |
4 | 10210210111312231301 |
5 | 20121330413242041 |
6 | 400152012103345 |
7 | 31460511450410 |
oct | 4444425665561 |
9 | 1100763171662 |
10 | 314142321521 |
11 | 111255172826 |
12 | 50a71764b55 |
13 | 23814a7b6b2 |
14 | 112c14a5477 |
15 | 828905659b |
hex | 4924576b71 |
314142321521 has 4 divisors (see below), whose sum is σ = 359019796032. Its totient is φ = 269264847012.
The previous prime is 314142321517. The next prime is 314142321539. The reversal of 314142321521 is 125123241413.
It is a happy number.
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 not a de Polignac number, because 314142321521 - 22 = 314142321517 is a prime.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (314142321221) 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 3 ways as a sum of consecutive naturals, for example, 22438737245 + ... + 22438737258.
It is an arithmetic number, because the mean of its divisors is an integer number (89754949008).
Almost surely, 2314142321521 is an apocalyptic number.
It is an amenable number.
314142321521 is a deficient number, since it is larger than the sum of its proper divisors (44877474511).
314142321521 is an equidigital number, since it uses as much as digits as its factorization.
314142321521 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 44877474510.
The product of its digits is 5760, while the sum is 29.
Adding to 314142321521 its reverse (125123241413), we get a palindrome (439265562934).
The spelling of 314142321521 in words is "three hundred fourteen billion, one hundred forty-two million, three hundred twenty-one thousand, five hundred twenty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.083 sec. • engine limits •