Base | Representation |
---|---|
bin | 11001010101110100000010… |
… | …001011111100101010100101 |
3 | 112121121112022002112110110221 |
4 | 121111310002023330222211 |
5 | 104101444343110103110 |
6 | 1033011253334044341 |
7 | 32322002304206125 |
oct | 3125640213745245 |
9 | 477545262473427 |
10 | 111450143050405 |
11 | 32569816286405 |
12 | 105bb94b4a96b1 |
13 | 4a2591b482953 |
14 | 1d74303c76c85 |
15 | cd4119a727da |
hex | 655d022fcaa5 |
111450143050405 has 32 divisors (see below), whose sum is σ = 134876497158144. Its totient is φ = 88405829615616.
The previous prime is 111450143050403. The next prime is 111450143050409. The reversal of 111450143050405 is 504050341054111.
It is a cyclic number.
It is not a de Polignac number, because 111450143050405 - 21 = 111450143050403 is a prime.
It is a super-2 number, since 2×1114501430504052 (a number of 29 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 (111450143050403) 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 31 ways as a sum of consecutive naturals, for example, 4777719852 + ... + 4777743178.
It is an arithmetic number, because the mean of its divisors is an integer number (4214890536192).
Almost surely, 2111450143050405 is an apocalyptic number.
It is an amenable number.
111450143050405 is a deficient number, since it is larger than the sum of its proper divisors (23426354107739).
111450143050405 is a wasteful number, since it uses less digits than its factorization.
111450143050405 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 40485.
The product of its (nonzero) digits is 24000, while the sum is 34.
The spelling of 111450143050405 in words is "one hundred eleven trillion, four hundred fifty billion, one hundred forty-three million, fifty thousand, four hundred five".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.074 sec. • engine limits •