Base | Representation |
---|---|
bin | 10011011011101101100… |
… | …011010111011110010101 |
3 | 11201122222002100211112202 |
4 | 103123231203113132111 |
5 | 133334422341130031 |
6 | 2501252543254245 |
7 | 165324041020124 |
oct | 23335543273625 |
9 | 4648862324482 |
10 | 1335425333141 |
11 | 475394871319 |
12 | 1969932aa385 |
13 | 98c1248c423 |
14 | 488c6371abb |
15 | 24b0dec02cb |
hex | 136ed8d7795 |
1335425333141 has 4 divisors (see below), whose sum is σ = 1341308264352. Its totient is φ = 1329542401932.
The previous prime is 1335425333057. The next prime is 1335425333251. The reversal of 1335425333141 is 1413335245331.
It is a semiprime because it is the product of two primes, and also a Blum integer, because the two primes are equal to 3 mod 4.
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-1335425333141 is a prime.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 1335425333095 and 1335425333104.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (1335425333741) 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, 2941465265 + ... + 2941465718.
It is an arithmetic number, because the mean of its divisors is an integer number (335327066088).
Almost surely, 21335425333141 is an apocalyptic number.
It is an amenable number.
1335425333141 is a deficient number, since it is larger than the sum of its proper divisors (5882931211).
1335425333141 is an equidigital number, since it uses as much as digits as its factorization.
1335425333141 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 5882931210.
The product of its digits is 194400, while the sum is 38.
The spelling of 1335425333141 in words is "one trillion, three hundred thirty-five billion, four hundred twenty-five million, three hundred thirty-three thousand, one hundred forty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.067 sec. • engine limits •