Base | Representation |
---|---|
bin | 101101101110010100011… |
… | …111101000101001111101 |
3 | 102010101100012211220220012 |
4 | 231232110133220221331 |
5 | 402440021234224313 |
6 | 10403244433433005 |
7 | 443003321563544 |
oct | 55562437505175 |
9 | 12111305756805 |
10 | 3142112414333 |
11 | 10016205a7a92 |
12 | 428b6710b765 |
13 | 19a3b8c384b9 |
14 | ac116cc315b |
15 | 56b00b30da8 |
hex | 2db947e8a7d |
3142112414333 has 2 divisors, whose sum is σ = 3142112414334. Its totient is φ = 3142112414332.
The previous prime is 3142112414297. The next prime is 3142112414407. The reversal of 3142112414333 is 3334142112413.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 1871131259449 + 1270981154884 = 1367893^2 + 1127378^2 .
It is a cyclic number.
It is not a de Polignac number, because 3142112414333 - 26 = 3142112414269 is a prime.
It is a self number, because there is not a number n which added to its sum of digits gives 3142112414333.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (3142112464333) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 1571056207166 + 1571056207167.
It is an arithmetic number, because the mean of its divisors is an integer number (1571056207167).
Almost surely, 23142112414333 is an apocalyptic number.
It is an amenable number.
3142112414333 is a deficient number, since it is larger than the sum of its proper divisors (1).
3142112414333 is an equidigital number, since it uses as much as digits as its factorization.
3142112414333 is an odious number, because the sum of its binary digits is odd.
The product of its digits is 20736, while the sum is 32.
Adding to 3142112414333 its reverse (3334142112413), we get a palindrome (6476254526746).
The spelling of 3142112414333 in words is "three trillion, one hundred forty-two billion, one hundred twelve million, four hundred fourteen thousand, three hundred thirty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •