Base | Representation |
---|---|
bin | 101101101110011100101… |
… | …100101011101101100011 |
3 | 102010101200210211122220021 |
4 | 231232130230223231203 |
5 | 402440312003134301 |
6 | 10403310231454311 |
7 | 443006612516056 |
oct | 55563454535543 |
9 | 12111623748807 |
10 | 3142250052451 |
11 | 10016912665a4 |
12 | 428ba5227397 |
13 | 19a40b5c9783 |
14 | ac12b2b0a9d |
15 | 56b0cc6c8a1 |
hex | 2db9cb2bb63 |
3142250052451 has 2 divisors, whose sum is σ = 3142250052452. Its totient is φ = 3142250052450.
The previous prime is 3142250052449. The next prime is 3142250052481. The reversal of 3142250052451 is 1542500522413.
It is a happy number.
3142250052451 is digitally balanced in base 3, because in such base it contains all the possibile digits an equal number of times.
It is a weak prime.
It is a cyclic number.
It is not a de Polignac number, because 3142250052451 - 21 = 3142250052449 is a prime.
It is a super-2 number, since 2×31422500524512 (a number of 26 digits) contains 22 as substring.
Together with 3142250052449, it forms a pair of twin primes.
It is not a weakly prime, because it can be changed into another prime (3142250052481) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 1571125026225 + 1571125026226.
It is an arithmetic number, because the mean of its divisors is an integer number (1571125026226).
Almost surely, 23142250052451 is an apocalyptic number.
3142250052451 is a deficient number, since it is larger than the sum of its proper divisors (1).
3142250052451 is an equidigital number, since it uses as much as digits as its factorization.
3142250052451 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 48000, while the sum is 34.
Adding to 3142250052451 its reverse (1542500522413), we get a palindrome (4684750574864).
The spelling of 3142250052451 in words is "three trillion, one hundred forty-two billion, two hundred fifty million, fifty-two thousand, four hundred fifty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •