Base | Representation |
---|---|
bin | 10011101110010110101… |
… | …010111101001101111001 |
3 | 11210120122010021101010122 |
4 | 103232112222331031321 |
5 | 134201421242311213 |
6 | 2514403125423025 |
7 | 166633062335021 |
oct | 23562652751571 |
9 | 4716563241118 |
10 | 1355442541433 |
11 | 482926a84172 |
12 | 19a83ab6aa75 |
13 | 9aa825b0886 |
14 | 49864a56a81 |
15 | 253d14d9d08 |
hex | 13b96abd379 |
1355442541433 has 4 divisors (see below), whose sum is σ = 1359326331300. Its totient is φ = 1351558751568.
The previous prime is 1355442541393. The next prime is 1355442541441. The reversal of 1355442541433 is 3341452445531.
It is a semiprime because it is the product of two primes.
It can be written as a sum of positive squares in 2 ways, for example, as 546968222329 + 808474319104 = 739573^2 + 899152^2 .
It is a cyclic number.
It is not a de Polignac number, because 1355442541433 - 214 = 1355442525049 is a prime.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (1355442541463) by changing a digit.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 1941894410 + ... + 1941895107.
It is an arithmetic number, because the mean of its divisors is an integer number (339831582825).
Almost surely, 21355442541433 is an apocalyptic number.
It is an amenable number.
1355442541433 is a deficient number, since it is larger than the sum of its proper divisors (3883789867).
1355442541433 is an equidigital number, since it uses as much as digits as its factorization.
1355442541433 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 3883789866.
The product of its digits is 1728000, while the sum is 44.
Adding to 1355442541433 its reverse (3341452445531), we get a palindrome (4696894986964).
The spelling of 1355442541433 in words is "one trillion, three hundred fifty-five billion, four hundred forty-two million, five hundred forty-one thousand, four hundred thirty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.085 sec. • engine limits •