Base | Representation |
---|---|
bin | 1000011100001101011… |
… | …0111111110110110011 |
3 | 111212022002201210102011 |
4 | 2013003112333312303 |
5 | 4333440421202421 |
6 | 150341203503351 |
7 | 13322343316516 |
oct | 2070326776663 |
9 | 455262653364 |
10 | 145011506611 |
11 | 56554240244 |
12 | 24130087b57 |
13 | 1089cc1c11a |
14 | 7039046d7d |
15 | 3b8ab9c4e1 |
hex | 21c35bfdb3 |
145011506611 has 8 divisors (see below), whose sum is σ = 146108270000. Its totient is φ = 143915508000.
The previous prime is 145011506609. The next prime is 145011506641. The reversal of 145011506611 is 116605110541.
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 145011506611 - 21 = 145011506609 is a prime.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (145011506641) 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 7 ways as a sum of consecutive naturals, for example, 192361 + ... + 571861.
It is an arithmetic number, because the mean of its divisors is an integer number (18263533750).
Almost surely, 2145011506611 is an apocalyptic number.
145011506611 is a deficient number, since it is larger than the sum of its proper divisors (1096763389).
145011506611 is a wasteful number, since it uses less digits than its factorization.
145011506611 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 382389.
The product of its (nonzero) digits is 3600, while the sum is 31.
The spelling of 145011506611 in words is "one hundred forty-five billion, eleven million, five hundred six thousand, six hundred eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.079 sec. • engine limits •