Base | Representation |
---|---|
bin | 10100101100110111100… |
… | …011100000000101110101 |
3 | 12000222220002022222012201 |
4 | 110230313203200011311 |
5 | 141301403423301331 |
6 | 3005303511144501 |
7 | 204530342300146 |
oct | 24546743400565 |
9 | 5028802288181 |
10 | 1422566228341 |
11 | 4a9341605685 |
12 | 1ab852675131 |
13 | a41bbb5bacb |
14 | 4cbd1661acd |
15 | 2700e339a61 |
hex | 14b378e0175 |
1422566228341 has 8 divisors (see below), whose sum is σ = 1507251456000. Its totient is φ = 1337992651968.
The previous prime is 1422566228339. The next prime is 1422566228351. The reversal of 1422566228341 is 1438226652241.
It is a sphenic number, since it is the product of 3 distinct primes.
It is a cyclic number.
It is not a de Polignac number, because 1422566228341 - 21 = 1422566228339 is a prime.
It is a super-2 number, since 2×14225662283412 (a number of 25 digits) contains 22 as substring.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 1422566228291 and 1422566228300.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (1422566228351) by changing a digit.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 27886581 + ... + 27937546.
It is an arithmetic number, because the mean of its divisors is an integer number (188406432000).
Almost surely, 21422566228341 is an apocalyptic number.
It is an amenable number.
1422566228341 is a deficient number, since it is larger than the sum of its proper divisors (84685227659).
1422566228341 is a wasteful number, since it uses less digits than its factorization.
1422566228341 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 55825643.
The product of its digits is 1105920, while the sum is 46.
The spelling of 1422566228341 in words is "one trillion, four hundred twenty-two billion, five hundred sixty-six million, two hundred twenty-eight thousand, three hundred forty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.064 sec. • engine limits •