Base | Representation |
---|---|
bin | 101111110101011000111… |
… | …111100100111110000101 |
3 | 102122020200122120012202202 |
4 | 233311120333210332011 |
5 | 412324032104333244 |
6 | 10554032003244245 |
7 | 456326316564563 |
oct | 57653077447605 |
9 | 12566618505682 |
10 | 3287143042949 |
11 | 1058084608937 |
12 | 4510a1679685 |
13 | 1aac8cac11cc |
14 | b51546a6a33 |
15 | 5a78d30904e |
hex | 2fd58fe4f85 |
3287143042949 has 2 divisors, whose sum is σ = 3287143042950. Its totient is φ = 3287143042948.
The previous prime is 3287143042831. The next prime is 3287143042999. The reversal of 3287143042949 is 9492403417823.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 2784249320449 + 502893722500 = 1668607^2 + 709150^2 .
It is a cyclic number.
It is not a de Polignac number, because 3287143042949 - 28 = 3287143042693 is a prime.
It is a super-2 number, since 2×32871430429492 (a number of 26 digits) contains 22 as substring.
It is a junction number, because it is equal to n+sod(n) for n = 3287143042894 and 3287143042903.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (3287143042999) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 1643571521474 + 1643571521475.
It is an arithmetic number, because the mean of its divisors is an integer number (1643571521475).
Almost surely, 23287143042949 is an apocalyptic number.
It is an amenable number.
3287143042949 is a deficient number, since it is larger than the sum of its proper divisors (1).
3287143042949 is an equidigital number, since it uses as much as digits as its factorization.
3287143042949 is an evil number, because the sum of its binary digits is even.
The product of its (nonzero) digits is 10450944, while the sum is 56.
The spelling of 3287143042949 in words is "three trillion, two hundred eighty-seven billion, one hundred forty-three million, forty-two thousand, nine hundred forty-nine".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •