Base | Representation |
---|---|
bin | 1000010011001111101… |
… | …1000100110110110001 |
3 | 111122002101112212220121 |
4 | 2010303323010312301 |
5 | 4314023342421134 |
6 | 145302321010241 |
7 | 13205612612116 |
oct | 2046373046661 |
9 | 448071485817 |
10 | 142605045169 |
11 | 55529915134 |
12 | 2377a183981 |
13 | 105a84b0442 |
14 | 6c8b5c490d |
15 | 3a9979bab4 |
hex | 2133ec4db1 |
142605045169 has 2 divisors, whose sum is σ = 142605045170. Its totient is φ = 142605045168.
The previous prime is 142605045101. The next prime is 142605045199. The reversal of 142605045169 is 961540506241.
142605045169 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 101434606144 + 41170439025 = 318488^2 + 202905^2 .
It is a cyclic number.
It is not a de Polignac number, because 142605045169 - 231 = 140457561521 is a prime.
It is a super-2 number, since 2×1426050451692 (a number of 23 digits) contains 22 as substring.
It is not a weakly prime, because it can be changed into another prime (142605045199) 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 as a sum of consecutive naturals, namely, 71302522584 + 71302522585.
It is an arithmetic number, because the mean of its divisors is an integer number (71302522585).
Almost surely, 2142605045169 is an apocalyptic number.
It is an amenable number.
142605045169 is a deficient number, since it is larger than the sum of its proper divisors (1).
142605045169 is an equidigital number, since it uses as much as digits as its factorization.
142605045169 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 259200, while the sum is 43.
The spelling of 142605045169 in words is "one hundred forty-two billion, six hundred five million, forty-five thousand, one hundred sixty-nine".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.086 sec. • engine limits •