Base | Representation |
---|---|
bin | 10011101010010001101… |
… | …001001011101101100101 |
3 | 11210011022220210221210212 |
4 | 103222101221023231211 |
5 | 134113434141120031 |
6 | 2512400405425205 |
7 | 166416414625142 |
oct | 23522151135545 |
9 | 4704286727725 |
10 | 1351063223141 |
11 | 480a89a70555 |
12 | 199a1840b205 |
13 | 9a53520c388 |
14 | 4956b1a33c9 |
15 | 25226cd912b |
hex | 13a91a4bb65 |
1351063223141 has 8 divisors (see below), whose sum is σ = 1411146521664. Its totient is φ = 1291091709600.
The previous prime is 1351063223137. The next prime is 1351063223143. The reversal of 1351063223141 is 1413223601531.
It is a sphenic number, since it is the product of 3 distinct primes.
It is a cyclic number.
It is not a de Polignac number, because 1351063223141 - 22 = 1351063223137 is a prime.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 1351063223098 and 1351063223107.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (1351063223143) 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, 27921536 + ... + 27969881.
It is an arithmetic number, because the mean of its divisors is an integer number (176393315208).
Almost surely, 21351063223141 is an apocalyptic number.
It is an amenable number.
1351063223141 is a deficient number, since it is larger than the sum of its proper divisors (60083298523).
1351063223141 is a wasteful number, since it uses less digits than its factorization.
1351063223141 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 55892491.
The product of its (nonzero) digits is 12960, while the sum is 32.
Adding to 1351063223141 its reverse (1413223601531), we get a palindrome (2764286824672).
The spelling of 1351063223141 in words is "one trillion, three hundred fifty-one billion, sixty-three million, two hundred twenty-three thousand, one hundred forty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •