Base | Representation |
---|---|
bin | 100001000000111100011100… |
… | …001100111010111111111111 |
3 | 201001010000200210111220200202 |
4 | 201000330130030322333333 |
5 | 123012430441211302221 |
6 | 1232452054032114115 |
7 | 42404246035304042 |
oct | 4100743414727777 |
9 | 631100623456622 |
10 | 145200432525311 |
11 | 422a118087a639 |
12 | 1435099709593b |
13 | 630345a5b2967 |
14 | 27bda4a384c59 |
15 | 11bbee311cd0b |
hex | 840f1c33afff |
145200432525311 has 8 divisors (see below), whose sum is σ = 147260274172704. Its totient is φ = 143141001020640.
The previous prime is 145200432525263. The next prime is 145200432525319. The reversal of 145200432525311 is 113525234002541.
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 145200432525311 - 218 = 145200432263167 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 (145200432525319) 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, 101822576 + ... + 103238741.
It is an arithmetic number, because the mean of its divisors is an integer number (18407534271588).
Almost surely, 2145200432525311 is an apocalyptic number.
145200432525311 is a deficient number, since it is larger than the sum of its proper divisors (2059841647393).
145200432525311 is an equidigital number, since it uses as much as digits as its factorization.
145200432525311 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 205071361.
The product of its (nonzero) digits is 144000, while the sum is 38.
Adding to 145200432525311 its reverse (113525234002541), we get a palindrome (258725666527852).
The spelling of 145200432525311 in words is "one hundred forty-five trillion, two hundred billion, four hundred thirty-two million, five hundred twenty-five thousand, three hundred eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.074 sec. • engine limits •