Base | Representation |
---|---|
bin | 101101110000100100110… |
… | …101011001111100001011 |
3 | 102010121120222120021020222 |
4 | 231300210311121330023 |
5 | 403010001203242311 |
6 | 10404325021340255 |
7 | 443120325220625 |
oct | 55604465317413 |
9 | 12117528507228 |
10 | 3144534040331 |
11 | 1002653540492 |
12 | 42952210768b |
13 | 19a6b38566a8 |
14 | ac2a6771c15 |
15 | 56be3529adb |
hex | 2dc24d59f0b |
3144534040331 has 2 divisors, whose sum is σ = 3144534040332. Its totient is φ = 3144534040330.
The previous prime is 3144534040313. The next prime is 3144534040363. The reversal of 3144534040331 is 1330404354413.
Together with previous prime (3144534040313) it forms an Ormiston pair, because they use the same digits, order apart.
It is a weak prime.
It is a cyclic number.
It is not a de Polignac number, because 3144534040331 - 210 = 3144534039307 is a prime.
It is a super-2 number, since 2×31445340403312 (a number of 26 digits) contains 22 as substring.
It is a junction number, because it is equal to n+sod(n) for n = 3144534040291 and 3144534040300.
It is not a weakly prime, because it can be changed into another prime (3144534040301) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 1572267020165 + 1572267020166.
It is an arithmetic number, because the mean of its divisors is an integer number (1572267020166).
Almost surely, 23144534040331 is an apocalyptic number.
3144534040331 is a deficient number, since it is larger than the sum of its proper divisors (1).
3144534040331 is an equidigital number, since it uses as much as digits as its factorization.
3144534040331 is an evil number, because the sum of its binary digits is even.
The product of its (nonzero) digits is 103680, while the sum is 35.
Adding to 3144534040331 its reverse (1330404354413), we get a palindrome (4474938394744).
The spelling of 3144534040331 in words is "three trillion, one hundred forty-four billion, five hundred thirty-four million, forty thousand, three hundred thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.066 sec. • engine limits •