Base | Representation |
---|---|
bin | 100001000001100011101001… |
… | …000111111001010010101101 |
3 | 201001021001100022101111112210 |
4 | 201001203221013321102231 |
5 | 123014123142430230131 |
6 | 1232523254525121033 |
7 | 42410266113430206 |
oct | 4101435107712255 |
9 | 631231308344483 |
10 | 145242525242541 |
11 | 42308011042051 |
12 | 14358b839b9179 |
13 | 63074080a322c |
14 | 27c1ac08645ad |
15 | 11bd1586ce146 |
hex | 8418e91f94ad |
145242525242541 has 8 divisors (see below), whose sum is σ = 193657349501344. Its totient is φ = 96828025572720.
The previous prime is 145242525242537. The next prime is 145242525242567.
145242525242541 is nontrivially palindromic in base 10.
It is a sphenic number, since it is the product of 3 distinct primes.
It is not a de Polignac number, because 145242525242541 - 22 = 145242525242537 is a prime.
It is a super-2 number, since 2×1452425252425412 (a number of 29 digits) contains 22 as substring.
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (145242525742541) 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, 80101231 + ... + 81894396.
It is an arithmetic number, because the mean of its divisors is an integer number (24207168687668).
Almost surely, 2145242525242541 is an apocalyptic number.
It is an amenable number.
145242525242541 is a deficient number, since it is larger than the sum of its proper divisors (48414824258803).
145242525242541 is a wasteful number, since it uses less digits than its factorization.
145242525242541 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 162294491.
The product of its digits is 5120000, while the sum is 48.
The spelling of 145242525242541 in words is "one hundred forty-five trillion, two hundred forty-two billion, five hundred twenty-five million, two hundred forty-two thousand, five hundred forty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.076 sec. • engine limits •