Base | Representation |
---|---|
bin | 100001000011111111110000… |
… | …001010010000010011110001 |
3 | 201001212002000011100101002221 |
4 | 201003333300022100103301 |
5 | 123024344440114314121 |
6 | 1233132255505441041 |
7 | 42425351666200003 |
oct | 4103776012202361 |
9 | 631762004311087 |
10 | 145410147026161 |
11 | 42372108186036 |
12 | 14385564040181 |
13 | 631a16c3ca894 |
14 | 27c9c6270c373 |
15 | 11c26b9357b41 |
hex | 843ff02904f1 |
145410147026161 has 8 divisors (see below), whose sum is σ = 148084135282944. Its totient is φ = 142750973109360.
The previous prime is 145410147026093. The next prime is 145410147026227. The reversal of 145410147026161 is 161620741014541.
It is a happy number.
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 145410147026161 - 213 = 145410147017969 is a prime.
It is a super-2 number, since 2×1454101470261612 (a number of 29 digits) contains 22 as substring.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (145410147026561) 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, 3703565185 + ... + 3703604446.
It is an arithmetic number, because the mean of its divisors is an integer number (18510516910368).
Almost surely, 2145410147026161 is an apocalyptic number.
It is an amenable number.
145410147026161 is a deficient number, since it is larger than the sum of its proper divisors (2673988256783).
145410147026161 is an equidigital number, since it uses as much as digits as its factorization.
145410147026161 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 7407169991.
The product of its (nonzero) digits is 161280, while the sum is 43.
The spelling of 145410147026161 in words is "one hundred forty-five trillion, four hundred ten billion, one hundred forty-seven million, twenty-six thousand, one hundred sixty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.082 sec. • engine limits •