Base | Representation |
---|---|
bin | 100001010101111011011010… |
… | …111010000001010001110101 |
3 | 201020012212210012101112201021 |
4 | 201111323122322001101311 |
5 | 123210042212143001314 |
6 | 1235514335410501141 |
7 | 42613365342161242 |
oct | 4125733272012165 |
9 | 636185705345637 |
10 | 146642446062709 |
11 | 427a7791929363 |
12 | 145443565947b1 |
13 | 63a942847611c |
14 | 282d76473c5c9 |
15 | 11e478e8ed324 |
hex | 855edae81475 |
146642446062709 has 2 divisors, whose sum is σ = 146642446062710. Its totient is φ = 146642446062708.
The previous prime is 146642446062703. The next prime is 146642446062713. The reversal of 146642446062709 is 907260644246641.
146642446062709 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., 109254296340484 + 37388149722225 = 10452478^2 + 6114585^2 .
It is a cyclic number.
It is not a de Polignac number, because 146642446062709 - 211 = 146642446060661 is a prime.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (146642446062703) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 73321223031354 + 73321223031355.
It is an arithmetic number, because the mean of its divisors is an integer number (73321223031355).
Almost surely, 2146642446062709 is an apocalyptic number.
It is an amenable number.
146642446062709 is a deficient number, since it is larger than the sum of its proper divisors (1).
146642446062709 is an equidigital number, since it uses as much as digits as its factorization.
146642446062709 is an evil number, because the sum of its binary digits is even.
The product of its (nonzero) digits is 83607552, while the sum is 61.
The spelling of 146642446062709 in words is "one hundred forty-six trillion, six hundred forty-two billion, four hundred forty-six million, sixty-two thousand, seven hundred nine".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •