Base | Representation |
---|---|
bin | 10011101100011101000… |
… | …011100010100100100101 |
3 | 11210101100220221112121011 |
4 | 103230131003202210211 |
5 | 134133231423244131 |
6 | 2513424441222221 |
7 | 166531365411166 |
oct | 23543503424445 |
9 | 4711326845534 |
10 | 1353402165541 |
11 | 481a7a26a5a8 |
12 | 19a36b791971 |
13 | 9a81896a86a |
14 | 4970da8b76d |
15 | 253122ee0b1 |
hex | 13b1d0e2925 |
1353402165541 has 8 divisors (see below), whose sum is σ = 1368127997568. Its totient is φ = 1338702330000.
The previous prime is 1353402165529. The next prime is 1353402165569. The reversal of 1353402165541 is 1455612043531.
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 1353402165541 - 29 = 1353402165029 is a prime.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 1353402165494 and 1353402165503.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (1353402168541) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 6394425 + ... + 6602686.
It is an arithmetic number, because the mean of its divisors is an integer number (171015999696).
Almost surely, 21353402165541 is an apocalyptic number.
It is an amenable number.
1353402165541 is a deficient number, since it is larger than the sum of its proper divisors (14725832027).
1353402165541 is a wasteful number, since it uses less digits than its factorization.
1353402165541 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 12998243.
The product of its (nonzero) digits is 216000, while the sum is 40.
The spelling of 1353402165541 in words is "one trillion, three hundred fifty-three billion, four hundred two million, one hundred sixty-five thousand, five hundred forty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.080 sec. • engine limits •