Base | Representation |
---|---|
bin | 100001000101100111001100… |
… | …111011001110011011001101 |
3 | 201002020200201101012210102211 |
4 | 201011213030323032123031 |
5 | 123033204432102032141 |
6 | 1233255310004550421 |
7 | 42436363420524526 |
oct | 4105471473163315 |
9 | 632220641183384 |
10 | 145521225033421 |
11 | 42405228889a36 |
12 | 143a2ba39b2411 |
13 | 6327792047cb3 |
14 | 27d139cb4784d |
15 | 11c551added81 |
hex | 8459ccece6cd |
145521225033421 has 8 divisors (see below), whose sum is σ = 147452575695264. Its totient is φ = 143594114440560.
The previous prime is 145521225033407. The next prime is 145521225033469. The reversal of 145521225033421 is 124330522125541.
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 145521225033421 - 25 = 145521225033389 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 (145521225033721) 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, 1059948150 + ... + 1060085431.
It is an arithmetic number, because the mean of its divisors is an integer number (18431571961908).
Almost surely, 2145521225033421 is an apocalyptic number.
It is an amenable number.
145521225033421 is a deficient number, since it is larger than the sum of its proper divisors (1931350661843).
145521225033421 is an equidigital number, since it uses as much as digits as its factorization.
145521225033421 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 2120034491.
The product of its (nonzero) digits is 288000, while the sum is 40.
Adding to 145521225033421 its reverse (124330522125541), we get a palindrome (269851747158962).
The spelling of 145521225033421 in words is "one hundred forty-five trillion, five hundred twenty-one billion, two hundred twenty-five million, thirty-three thousand, four hundred twenty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.082 sec. • engine limits •