Base | Representation |
---|---|
bin | 10011101110001011010… |
… | …000101010110111010101 |
3 | 11210120010210001012102110 |
4 | 103232023100222313111 |
5 | 134201023240214031 |
6 | 2514332130301233 |
7 | 166625246201040 |
oct | 23561320526725 |
9 | 4716123035373 |
10 | 1355251101141 |
11 | 482838a08253 |
12 | 19a7a6a27819 |
13 | 9aa51a326b2 |
14 | 49847461c57 |
15 | 253be7c1c46 |
hex | 13b8b42add5 |
1355251101141 has 8 divisors (see below), whose sum is σ = 2065144535104. Its totient is φ = 774429200640.
The previous prime is 1355251101133. The next prime is 1355251101161. The reversal of 1355251101141 is 1411011525531.
It is a sphenic number, since it is the product of 3 distinct primes.
It is not a de Polignac number, because 1355251101141 - 23 = 1355251101133 is a prime.
It is a Curzon number.
It is a junction number, because it is equal to n+sod(n) for n = 1355251101099 and 1355251101108.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (1355251101131) by changing a digit.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 32267883340 + ... + 32267883381.
It is an arithmetic number, because the mean of its divisors is an integer number (258143066888).
Almost surely, 21355251101141 is an apocalyptic number.
It is an amenable number.
1355251101141 is a deficient number, since it is larger than the sum of its proper divisors (709893433963).
1355251101141 is an equidigital number, since it uses as much as digits as its factorization.
1355251101141 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 64535766731.
The product of its (nonzero) digits is 3000, while the sum is 30.
Adding to 1355251101141 its reverse (1411011525531), we get a palindrome (2766262626672).
The spelling of 1355251101141 in words is "one trillion, three hundred fifty-five billion, two hundred fifty-one million, one hundred one thousand, one hundred forty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •