Base | Representation |
---|---|
bin | 1000011110100001011… |
… | …1100001001100011001 |
3 | 111220220101001110020021 |
4 | 2013220113201030121 |
5 | 4341223343301103 |
6 | 150522543430441 |
7 | 13343622656002 |
oct | 2075027411431 |
9 | 456811043207 |
10 | 145632400153 |
11 | 568427697a9 |
12 | 24283bb5421 |
13 | 1096b751a56 |
14 | 70976ac1a9 |
15 | 3bc5445bbd |
hex | 21e85e1319 |
145632400153 has 4 divisors (see below), whose sum is σ = 145646545408. Its totient is φ = 145618254900.
The previous prime is 145632400139. The next prime is 145632400157. The reversal of 145632400153 is 351004236541.
It is a semiprime because it is the product of two primes, and also a Blum integer, because the two primes are equal to 3 mod 4.
It is a cyclic number.
It is not a de Polignac number, because 145632400153 - 221 = 145630303001 is a prime.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (145632400157) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (17) of ones.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 7057173 + ... + 7077778.
It is an arithmetic number, because the mean of its divisors is an integer number (36411636352).
Almost surely, 2145632400153 is an apocalyptic number.
It is an amenable number.
145632400153 is a deficient number, since it is larger than the sum of its proper divisors (14145255).
145632400153 is a wasteful number, since it uses less digits than its factorization.
145632400153 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 14145254.
The product of its (nonzero) digits is 43200, while the sum is 34.
Adding to 145632400153 its reverse (351004236541), we get a palindrome (496636636694).
The spelling of 145632400153 in words is "one hundred forty-five billion, six hundred thirty-two million, four hundred thousand, one hundred fifty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.067 sec. • engine limits •