Base | Representation |
---|---|
bin | 10011101100101010110… |
… | …000011111011110010101 |
3 | 11210101221221112001002201 |
4 | 103230222300133132111 |
5 | 134134214301200031 |
6 | 2513503332404501 |
7 | 166540156415344 |
oct | 23545260373625 |
9 | 4711857461081 |
10 | 1353632053141 |
11 | 482088006555 |
12 | 19a414776731 |
13 | 9a85448a924 |
14 | 4973240db5b |
15 | 253275add61 |
hex | 13b2ac1f795 |
1353632053141 has 8 divisors (see below), whose sum is σ = 1354329849600. Its totient is φ = 1352934372768.
The previous prime is 1353632053117. The next prime is 1353632053157. The reversal of 1353632053141 is 1413502363531.
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 1353632053141 - 215 = 1353632020373 is a prime.
It is a Duffinian number.
It is a self number, because there is not a number n which added to its sum of digits gives 1353632053141.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (1353632023141) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (23) of ones.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 31974310 + ... + 32016616.
It is an arithmetic number, because the mean of its divisors is an integer number (169291231200).
Almost surely, 21353632053141 is an apocalyptic number.
It is an amenable number.
1353632053141 is a deficient number, since it is larger than the sum of its proper divisors (697796459).
1353632053141 is a wasteful number, since it uses less digits than its factorization.
1353632053141 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 58043.
The product of its (nonzero) digits is 97200, while the sum is 37.
The spelling of 1353632053141 in words is "one trillion, three hundred fifty-three billion, six hundred thirty-two million, fifty-three thousand, one hundred forty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •