Base | Representation |
---|---|
bin | 10100101100101011110… |
… | …001100111101001111001 |
3 | 12000222101022110112212012 |
4 | 110230223301213221321 |
5 | 141301002330241440 |
6 | 3005232131255305 |
7 | 204522422432216 |
oct | 24545361475171 |
9 | 5028338415765 |
10 | 1422368602745 |
11 | 4a924aaa4642 |
12 | 1ab7b844a535 |
13 | a4189c2649c |
14 | 4cbb32dab0d |
15 | 26eebcede65 |
hex | 14b2bc67a79 |
1422368602745 has 8 divisors (see below), whose sum is σ = 1718297641800. Its totient is φ = 1130258003200.
The previous prime is 1422368602727. The next prime is 1422368602783. The reversal of 1422368602745 is 5472068632241.
It can be written as a sum of positive squares in 4 ways, for example, as 83006795881 + 1339361806864 = 288109^2 + 1157308^2 .
It is a sphenic number, since it is the product of 3 distinct primes.
It is not a de Polignac number, because 1422368602745 - 214 = 1422368586361 is a prime.
It is a Curzon number.
It is a junction number, because it is equal to n+sod(n) for n = 1422368602693 and 1422368602702.
It is an unprimeable number.
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, 954609056 + ... + 954610545.
It is an arithmetic number, because the mean of its divisors is an integer number (214787205225).
Almost surely, 21422368602745 is an apocalyptic number.
It is an amenable number.
1422368602745 is a deficient number, since it is larger than the sum of its proper divisors (295929039055).
1422368602745 is a wasteful number, since it uses less digits than its factorization.
1422368602745 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1909219755.
The product of its (nonzero) digits is 3870720, while the sum is 50.
The spelling of 1422368602745 in words is "one trillion, four hundred twenty-two billion, three hundred sixty-eight million, six hundred two thousand, seven hundred forty-five".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.074 sec. • engine limits •