Base | Representation |
---|---|
bin | 100000111111110101110000… |
… | …010100010000101111110011 |
3 | 201000211202210022122210222120 |
4 | 200333311300110100233303 |
5 | 123010210021241333321 |
6 | 1232353142442205323 |
7 | 42365621151242601 |
oct | 4077656024205763 |
9 | 630752708583876 |
10 | 145124534324211 |
11 | 42271a73267802 |
12 | 1433a134ab3843 |
13 | 62c92531c2ab0 |
14 | 27ba0ca29c871 |
15 | 11ba04ecd1ec6 |
hex | 83fd70510bf3 |
145124534324211 has 8 divisors (see below), whose sum is σ = 208383946722000. Its totient is φ = 89307405737952.
The previous prime is 145124534324171. The next prime is 145124534324227. The reversal of 145124534324211 is 112423435421541.
It is a sphenic number, since it is the product of 3 distinct primes.
It is not a de Polignac number, because 145124534324211 - 214 = 145124534307827 is a prime.
It is a super-2 number, since 2×1451245343242112 (a number of 29 digits) contains 22 as substring.
It is not an unprimeable number, because it can be changed into a prime (145124534324411) 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, 1860570952836 + ... + 1860570952913.
It is an arithmetic number, because the mean of its divisors is an integer number (26047993340250).
Almost surely, 2145124534324211 is an apocalyptic number.
145124534324211 is a deficient number, since it is larger than the sum of its proper divisors (63259412397789).
145124534324211 is a wasteful number, since it uses less digits than its factorization.
145124534324211 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 3721141905765.
The product of its digits is 460800, while the sum is 42.
Adding to 145124534324211 its reverse (112423435421541), we get a palindrome (257547969745752).
The spelling of 145124534324211 in words is "one hundred forty-five trillion, one hundred twenty-four billion, five hundred thirty-four million, three hundred twenty-four thousand, two hundred eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.076 sec. • engine limits •