Base | Representation |
---|---|
bin | 100001010111000000010101… |
… | …010010100010011110000001 |
3 | 201020110221202222001122221121 |
4 | 201113000111102202132001 |
5 | 123212300232120401143 |
6 | 1240012334013552241 |
7 | 42621625104316006 |
oct | 4127002522423601 |
9 | 636427688048847 |
10 | 146716440012673 |
11 | 42826102552123 |
12 | 14556766aa5681 |
13 | 63b33bb1a447b |
14 | 28331839718ad |
15 | 11e667098b7ed |
hex | 8570154a2781 |
146716440012673 has 2 divisors, whose sum is σ = 146716440012674. Its totient is φ = 146716440012672.
The previous prime is 146716440012671. The next prime is 146716440012689. The reversal of 146716440012673 is 376210044617641.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 92963670882289 + 53752769130384 = 9641767^2 + 7331628^2 .
It is a cyclic number.
It is not a de Polignac number, because 146716440012673 - 21 = 146716440012671 is a prime.
Together with 146716440012671, it forms a pair of twin primes.
It is a self number, because there is not a number n which added to its sum of digits gives 146716440012673.
It is not a weakly prime, because it can be changed into another prime (146716440012671) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 73358220006336 + 73358220006337.
It is an arithmetic number, because the mean of its divisors is an integer number (73358220006337).
Almost surely, 2146716440012673 is an apocalyptic number.
It is an amenable number.
146716440012673 is a deficient number, since it is larger than the sum of its proper divisors (1).
146716440012673 is an equidigital number, since it uses as much as digits as its factorization.
146716440012673 is an evil number, because the sum of its binary digits is even.
The product of its (nonzero) digits is 4064256, while the sum is 52.
The spelling of 146716440012673 in words is "one hundred forty-six trillion, seven hundred sixteen billion, four hundred forty million, twelve thousand, six hundred seventy-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.079 sec. • engine limits •