Base | Representation |
---|---|
bin | 10100101100100011100… |
… | …011000000011000100001 |
3 | 12000222000200200221210002 |
4 | 110230203203000120201 |
5 | 141300212010213040 |
6 | 3005210320345345 |
7 | 204516125150162 |
oct | 24544343003041 |
9 | 5028020627702 |
10 | 1422230554145 |
11 | 4a918a085695 |
12 | 1ab77a175255 |
13 | a416745041b |
14 | 4cb9cc43769 |
15 | 26edeb30a15 |
hex | 14b238c0621 |
1422230554145 has 4 divisors (see below), whose sum is σ = 1706676664980. Its totient is φ = 1137784443312.
The previous prime is 1422230554139. The next prime is 1422230554159. The reversal of 1422230554145 is 5414550322241.
It is a semiprime because it is the product of two primes.
It can be written as a sum of positive squares in 2 ways, for example, as 518156668561 + 904073885584 = 719831^2 + 950828^2 .
It is a cyclic number.
It is not a de Polignac number, because 1422230554145 - 212 = 1422230550049 is a prime.
It is a junction number, because it is equal to n+sod(n) for n = 1422230554099 and 1422230554108.
It is an unprimeable number.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 142223055410 + ... + 142223055419.
It is an arithmetic number, because the mean of its divisors is an integer number (426669166245).
Almost surely, 21422230554145 is an apocalyptic number.
It is an amenable number.
1422230554145 is a deficient number, since it is larger than the sum of its proper divisors (284446110835).
1422230554145 is an equidigital number, since it uses as much as digits as its factorization.
1422230554145 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 284446110834.
The product of its (nonzero) digits is 192000, while the sum is 38.
Adding to 1422230554145 its reverse (5414550322241), we get a palindrome (6836780876386).
The spelling of 1422230554145 in words is "one trillion, four hundred twenty-two billion, two hundred thirty million, five hundred fifty-four thousand, one hundred forty-five".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.086 sec. • engine limits •