Base | Representation |
---|---|
bin | 100010111000010001000010… |
… | …001001000001011110101001 |
3 | 202010010220122000101212000001 |
4 | 202320101002021001132221 |
5 | 130101302012332334140 |
6 | 1302131021131343001 |
7 | 44211540002425621 |
oct | 4270210211013651 |
9 | 663126560355001 |
10 | 153400161605545 |
11 | 44972709101a38 |
12 | 15255b8b8b1a61 |
13 | 677975b33a61a |
14 | 29c4870b41881 |
15 | 12b045483ee9a |
hex | 8b84422417a9 |
153400161605545 has 4 divisors (see below), whose sum is σ = 184080193926660. Its totient is φ = 122720129284432.
The previous prime is 153400161605521. The next prime is 153400161605563. The reversal of 153400161605545 is 545506161004351.
It is a semiprime because it is the product of two primes.
It can be written as a sum of positive squares in 2 ways, for example, as 55093253885289 + 98306907720256 = 7422483^2 + 9914984^2 .
It is a cyclic number.
It is not a de Polignac number, because 153400161605545 - 27 = 153400161605417 is a prime.
It is a junction number, because it is equal to n+sod(n) for n = 153400161605495 and 153400161605504.
It is an unprimeable number.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 15340016160550 + ... + 15340016160559.
It is an arithmetic number, because the mean of its divisors is an integer number (46020048481665).
Almost surely, 2153400161605545 is an apocalyptic number.
It is an amenable number.
153400161605545 is a deficient number, since it is larger than the sum of its proper divisors (30680032321115).
153400161605545 is an equidigital number, since it uses as much as digits as its factorization.
153400161605545 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 30680032321114.
The product of its (nonzero) digits is 1080000, while the sum is 46.
The spelling of 153400161605545 in words is "one hundred fifty-three trillion, four hundred billion, one hundred sixty-one million, six hundred five thousand, five hundred forty-five".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.078 sec. • engine limits •