Base | Representation |
---|---|
bin | 100001000111000101100010… |
… | …111101111000100010111011 |
3 | 201002121101012020220120010001 |
4 | 201013011202331320202323 |
5 | 123041334413244413233 |
6 | 1233414022024133431 |
7 | 42446610650353462 |
oct | 4107054275704273 |
9 | 632541166816101 |
10 | 145622526560443 |
11 | 424441919655a9 |
12 | 143ba755607277 |
13 | 63341b73a876a |
14 | 27d624c9a59d9 |
15 | 11c7e9951c27d |
hex | 847162f788bb |
145622526560443 has 8 divisors (see below), whose sum is σ = 146238417918656. Its totient is φ = 145007212694400.
The previous prime is 145622526560437. The next prime is 145622526560447. The reversal of 145622526560443 is 344065625226541.
145622526560443 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
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 145622526560443 - 25 = 145622526560411 is a prime.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (145622526560447) 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, 143867646 + ... + 144876307.
It is an arithmetic number, because the mean of its divisors is an integer number (18279802239832).
Almost surely, 2145622526560443 is an apocalyptic number.
145622526560443 is a deficient number, since it is larger than the sum of its proper divisors (615891358213).
145622526560443 is a wasteful number, since it uses less digits than its factorization.
145622526560443 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 288746085.
The product of its (nonzero) digits is 41472000, while the sum is 55.
The spelling of 145622526560443 in words is "one hundred forty-five trillion, six hundred twenty-two billion, five hundred twenty-six million, five hundred sixty thousand, four hundred forty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.080 sec. • engine limits •