Base | Representation |
---|---|
bin | 100001000001011101000111… |
… | …110100010010001011110010 |
3 | 201001020101021101022122210210 |
4 | 201001131013310102023302 |
5 | 123014014323121040141 |
6 | 1232520140104204550 |
7 | 42406630451034615 |
oct | 4101350764221362 |
9 | 631211241278723 |
10 | 145235524002546 |
11 | 4230504902089a |
12 | 1435774b169756 |
13 | 6306860754a83 |
14 | 27c1618aa417c |
15 | 11bcd98c1c916 |
hex | 841747d122f2 |
145235524002546 has 8 divisors (see below), whose sum is σ = 290471048005104. Its totient is φ = 48411841334180.
The previous prime is 145235524002493. The next prime is 145235524002559. The reversal of 145235524002546 is 645200425532541.
It is a sphenic number, since it is the product of 3 distinct primes.
145235524002546 is an admirable number.
It is a Curzon number.
It is a junction number, because it is equal to n+sod(n) for n = 145235524002495 and 145235524002504.
It is an unprimeable number.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 12102960333540 + ... + 12102960333551.
It is an arithmetic number, because the mean of its divisors is an integer number (36308881000638).
Almost surely, 2145235524002546 is an apocalyptic number.
145235524002546 is a primitive abundant number, since it is smaller than the sum of its proper divisors, none of which is abundant.
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
145235524002546 is a wasteful number, since it uses less digits than its factorization.
145235524002546 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 24205920667096.
The product of its (nonzero) digits is 5760000, while the sum is 48.
The spelling of 145235524002546 in words is "one hundred forty-five trillion, two hundred thirty-five billion, five hundred twenty-four million, two thousand, five hundred forty-six".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.081 sec. • engine limits •