Base | Representation |
---|---|
bin | 100001000110110001101111… |
… | …111111011001110010010111 |
3 | 201002112100022212100220002122 |
4 | 201012301233333121302113 |
5 | 123041012400134213241 |
6 | 1233400144455130155 |
7 | 42445226131452242 |
oct | 4106615777316227 |
9 | 632470285326078 |
10 | 145601270226071 |
11 | 42436174252a10 |
12 | 143b660297395b |
13 | 63321aa64400a |
14 | 27d51d38c8259 |
15 | 11c765333904b |
hex | 846c6ffd9c97 |
145601270226071 has 8 divisors (see below), whose sum is σ = 158837960571024. Its totient is φ = 132364615086720.
The previous prime is 145601270226047. The next prime is 145601270226091. The reversal of 145601270226071 is 170622072106541.
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 145601270226071 - 214 = 145601270209687 is a prime.
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (145601270226031) 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, 250865 + ... + 17066501.
It is an arithmetic number, because the mean of its divisors is an integer number (19854745071378).
Almost surely, 2145601270226071 is an apocalyptic number.
145601270226071 is a gapful number since it is divisible by the number (11) formed by its first and last digit.
145601270226071 is a deficient number, since it is larger than the sum of its proper divisors (13236690344953).
145601270226071 is a wasteful number, since it uses less digits than its factorization.
145601270226071 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 17602801.
The product of its (nonzero) digits is 282240, while the sum is 44.
The spelling of 145601270226071 in words is "one hundred forty-five trillion, six hundred one billion, two hundred seventy million, two hundred twenty-six thousand, seventy-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.078 sec. • engine limits •