Base | Representation |
---|---|
bin | 10000100111000100001… |
… | …001110000100110110111 |
3 | 11001010022010011001201202 |
4 | 100213010021300212313 |
5 | 122200201022214132 |
6 | 2232213405443115 |
7 | 145316242223066 |
oct | 20470411604667 |
9 | 4033263131652 |
10 | 1141457226167 |
11 | 4000a8934685 |
12 | 16527b87049b |
13 | 8383ca2482b |
14 | 3d3654021dd |
15 | 1ea5a383762 |
hex | 109c42709b7 |
1141457226167 has 4 divisors (see below), whose sum is σ = 1165743550176. Its totient is φ = 1117170902160.
The previous prime is 1141457226149. The next prime is 1141457226179. The reversal of 1141457226167 is 7616227541411.
It is a happy number.
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 1141457226167 - 26 = 1141457226103 is a prime.
It is a Harshad number since it is a multiple of its sum of digits (47), and also a Moran number because the ratio is a prime number: 24286323961 = 1141457226167 / (1 + 1 + 4 + 1 + 4 + 5 + 7 + 2 + 2 + 6 + 1 + 6 + 7).
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (1141457226187) by changing a digit.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 12143161934 + ... + 12143162027.
It is an arithmetic number, because the mean of its divisors is an integer number (291435887544).
Almost surely, 21141457226167 is an apocalyptic number.
1141457226167 is a deficient number, since it is larger than the sum of its proper divisors (24286324009).
1141457226167 is an equidigital number, since it uses as much as digits as its factorization.
1141457226167 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 24286324008.
The product of its digits is 564480, while the sum is 47.
The spelling of 1141457226167 in words is "one trillion, one hundred forty-one billion, four hundred fifty-seven million, two hundred twenty-six thousand, one hundred sixty-seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.102 sec. • engine limits •