Base | Representation |
---|---|
bin | 10100101100100101100… |
… | …110111011100000000101 |
3 | 12000222010002202221202101 |
4 | 110230211212323200011 |
5 | 141300244333342112 |
6 | 3005213553512101 |
7 | 204520025124244 |
oct | 24544546734005 |
9 | 5028102687671 |
10 | 1422265137157 |
11 | 4a91a7656397 |
12 | 1ab789872631 |
13 | a417166b447 |
14 | 4cba368695b |
15 | 26ee2bb2757 |
hex | 14b259bb805 |
1422265137157 has 4 divisors (see below), whose sum is σ = 1484102751840. Its totient is φ = 1360427522476.
The previous prime is 1422265137133. The next prime is 1422265137179. The reversal of 1422265137157 is 7517315622241.
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 1422265137157 - 219 = 1422264612869 is a prime.
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (1422265137107) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 30918807307 + ... + 30918807352.
It is an arithmetic number, because the mean of its divisors is an integer number (371025687960).
Almost surely, 21422265137157 is an apocalyptic number.
It is an amenable number.
1422265137157 is a deficient number, since it is larger than the sum of its proper divisors (61837614683).
1422265137157 is an equidigital number, since it uses as much as digits as its factorization.
1422265137157 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 61837614682.
The product of its digits is 705600, while the sum is 46.
The spelling of 1422265137157 in words is "one trillion, four hundred twenty-two billion, two hundred sixty-five million, one hundred thirty-seven thousand, one hundred fifty-seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •