Base | Representation |
---|---|
bin | 10100101100101001100… |
… | …000110010001110011110 |
3 | 12000222021200000121010120 |
4 | 110230221200302032132 |
5 | 141300413120311131 |
6 | 3005224253415410 |
7 | 204521451630450 |
oct | 24545140621636 |
9 | 5028250017116 |
10 | 1422330635166 |
11 | 4a9230621a81 |
12 | 1ab7a779a566 |
13 | a41820c1a6c |
14 | 4cbac2562d0 |
15 | 26ee87ee496 |
hex | 14b2983239e |
1422330635166 has 128 divisors (see below), whose sum is σ = 3516583280640. Its totient is φ = 374379408000.
The previous prime is 1422330635113. The next prime is 1422330635197. The reversal of 1422330635166 is 6615360332241.
It is a Harshad number since it is a multiple of its sum of digits (42).
It is a Curzon number.
It is a congruent number.
It is an unprimeable number.
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 63 ways as a sum of consecutive naturals, for example, 57592881 + ... + 57617571.
It is an arithmetic number, because the mean of its divisors is an integer number (27473306880).
Almost surely, 21422330635166 is an apocalyptic number.
It is a practical number, because each smaller number is the sum of distinct divisors of 1422330635166, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (1758291640320).
1422330635166 is an abundant number, since it is smaller than the sum of its proper divisors (2094252645474).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
1422330635166 is a wasteful number, since it uses less digits than its factorization.
1422330635166 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 26710.
The product of its (nonzero) digits is 466560, while the sum is 42.
The spelling of 1422330635166 in words is "one trillion, four hundred twenty-two billion, three hundred thirty million, six hundred thirty-five thousand, one hundred sixty-six".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •