Base | Representation |
---|---|
bin | 1000011101101010000… |
… | …1111111010110101111 |
3 | 111220022012020201110002 |
4 | 2013122201333112233 |
5 | 4340234431422421 |
6 | 150443532134515 |
7 | 13335103565354 |
oct | 2073241772657 |
9 | 456265221402 |
10 | 145400264111 |
11 | 56733727533 |
12 | 2421a30743b |
13 | 1093262544b |
14 | 707492262b |
15 | 3baed8eb0b |
hex | 21da87f5af |
145400264111 has 4 divisors (see below), whose sum is σ = 146759145192. Its totient is φ = 144041383032.
The previous prime is 145400264089. The next prime is 145400264129. The reversal of 145400264111 is 111462004541.
It is a semiprime because it is the product of two primes.
It is a cyclic number.
It is not a de Polignac number, because 145400264111 - 230 = 144326522287 is a prime.
It is a super-2 number, since 2×1454002641112 (a number of 23 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 (145400263111) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (23) of ones.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 679440380 + ... + 679440593.
It is an arithmetic number, because the mean of its divisors is an integer number (36689786298).
Almost surely, 2145400264111 is an apocalyptic number.
145400264111 is a deficient number, since it is larger than the sum of its proper divisors (1358881081).
145400264111 is a wasteful number, since it uses less digits than its factorization.
145400264111 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1358881080.
The product of its (nonzero) digits is 3840, while the sum is 29.
Adding to 145400264111 its reverse (111462004541), we get a palindrome (256862268652).
The spelling of 145400264111 in words is "one hundred forty-five billion, four hundred million, two hundred sixty-four thousand, one hundred eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.081 sec. • engine limits •