Base | Representation |
---|---|
bin | 10011011010100100101… |
… | …110001110100110111001 |
3 | 11201112210221011102021002 |
4 | 103122210232032212321 |
5 | 133324422040144031 |
6 | 2500531414054345 |
7 | 165251543103065 |
oct | 23324456164671 |
9 | 4645727142232 |
10 | 1334203443641 |
11 | 474918074692 |
12 | 1966b204a3b5 |
13 | 98a792a27a3 |
14 | 4880bd84aa5 |
15 | 24a8baadccb |
hex | 136a4b8e9b9 |
1334203443641 has 2 divisors, whose sum is σ = 1334203443642. Its totient is φ = 1334203443640.
The previous prime is 1334203443637. The next prime is 1334203443659. The reversal of 1334203443641 is 1463443024331.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 1022201881600 + 312001562041 = 1011040^2 + 558571^2 .
It is a cyclic number.
It is not a de Polignac number, because 1334203443641 - 22 = 1334203443637 is a prime.
It is a Sophie Germain prime.
It is a Curzon number.
It is a junction number, because it is equal to n+sod(n) for n = 1334203443595 and 1334203443604.
It is not a weakly prime, because it can be changed into another prime (1334203443631) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 667101721820 + 667101721821.
It is an arithmetic number, because the mean of its divisors is an integer number (667101721821).
Almost surely, 21334203443641 is an apocalyptic number.
It is an amenable number.
1334203443641 is a deficient number, since it is larger than the sum of its proper divisors (1).
1334203443641 is an equidigital number, since it uses as much as digits as its factorization.
1334203443641 is an evil number, because the sum of its binary digits is even.
The product of its (nonzero) digits is 248832, while the sum is 38.
Adding to 1334203443641 its reverse (1463443024331), we get a palindrome (2797646467972).
The spelling of 1334203443641 in words is "one trillion, three hundred thirty-four billion, two hundred three million, four hundred forty-three thousand, six hundred forty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.067 sec. • engine limits •