Base | Representation |
---|---|
bin | 100001000101011110101111… |
… | …011111001101011100110101 |
3 | 201002012211021022102000220120 |
4 | 201011132233133031130311 |
5 | 123033032331122344131 |
6 | 1233251204351122153 |
7 | 42435622336406502 |
oct | 4105365737153465 |
9 | 632184238360816 |
10 | 145512141215541 |
11 | 4240139724a131 |
12 | 143a1289813359 |
13 | 63269750cb929 |
14 | 27d0b7a5544a9 |
15 | 11c51886a8496 |
hex | 8457af7cd735 |
145512141215541 has 16 divisors (see below), whose sum is σ = 205687606768128. Its totient is φ = 91341535896000.
The previous prime is 145512141215513. The next prime is 145512141215579.
145512141215541 is nontrivially palindromic in base 10.
It is not a de Polignac number, because 145512141215541 - 211 = 145512141213493 is a prime.
It is a super-2 number, since 2×1455121412155412 (a number of 29 digits) contains 22 as substring.
It is a Curzon number.
It is a junction number, because it is equal to n+sod(n) for n = 145512141215493 and 145512141215502.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (145512141215141) by changing a digit.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 21143870610 + ... + 21143877491.
It is an arithmetic number, because the mean of its divisors is an integer number (12855475423008).
Almost surely, 2145512141215541 is an apocalyptic number.
It is an amenable number.
145512141215541 is a deficient number, since it is larger than the sum of its proper divisors (60175465552587).
145512141215541 is a wasteful number, since it uses less digits than its factorization.
145512141215541 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 42287748172.
The product of its digits is 160000, while the sum is 42.
The spelling of 145512141215541 in words is "one hundred forty-five trillion, five hundred twelve billion, one hundred forty-one million, two hundred fifteen thousand, five hundred forty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.109 sec. • engine limits •