Base | Representation |
---|---|
bin | 100001000011111000101010… |
… | …010010111011011111001101 |
3 | 201001211100100111011112020110 |
4 | 201003320222102323133031 |
5 | 123024233341301202414 |
6 | 1233125000134510233 |
7 | 42424662205256223 |
oct | 4103705222733715 |
9 | 631740314145213 |
10 | 145402532444109 |
11 | 4236995aa23916 |
12 | 14383b99b05379 |
13 | 6319527991a25 |
14 | 27c973d2d0b13 |
15 | 11c23c0ae0459 |
hex | 843e2a4bb7cd |
145402532444109 has 8 divisors (see below), whose sum is σ = 196525797276352. Its totient is φ = 95607144620640.
The previous prime is 145402532444093. The next prime is 145402532444129. The reversal of 145402532444109 is 901444235204541.
It is a happy number.
It is a sphenic number, since it is the product of 3 distinct primes.
It is not a de Polignac number, because 145402532444109 - 24 = 145402532444093 is a prime.
It is a super-2 number, since 2×1454025324441092 (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 (145402532444129) 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, 331969251937 + ... + 331969252374.
It is an arithmetic number, because the mean of its divisors is an integer number (24565724659544).
Almost surely, 2145402532444109 is an apocalyptic number.
It is an amenable number.
145402532444109 is a deficient number, since it is larger than the sum of its proper divisors (51123264832243).
145402532444109 is an equidigital number, since it uses as much as digits as its factorization.
145402532444109 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 663938504387.
The product of its (nonzero) digits is 2764800, while the sum is 48.
The spelling of 145402532444109 in words is "one hundred forty-five trillion, four hundred two billion, five hundred thirty-two million, four hundred forty-four thousand, one hundred nine".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •