Base | Representation |
---|---|
bin | 1000100011100100000… |
… | …0101011000111011101 |
3 | 112001101122220020102202 |
4 | 2020321000223013131 |
5 | 4402011223202411 |
6 | 151305114301245 |
7 | 13422301665536 |
oct | 2107100530735 |
9 | 461348806382 |
10 | 146985365981 |
11 | 57377452a83 |
12 | 245a1127825 |
13 | 10b25b4304c |
14 | 718525968d |
15 | 3c540e983b |
hex | 223902b1dd |
146985365981 has 2 divisors, whose sum is σ = 146985365982. Its totient is φ = 146985365980.
The previous prime is 146985365959. The next prime is 146985366019. The reversal of 146985365981 is 189563589641.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 140977720900 + 6007645081 = 375470^2 + 77509^2 .
It is an emirp because it is prime and its reverse (189563589641) is a distict prime.
It is a cyclic number.
It is not a de Polignac number, because 146985365981 - 210 = 146985364957 is a prime.
It is a super-2 number, since 2×1469853659812 (a number of 23 digits) contains 22 as substring.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (146985365921) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (17) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 73492682990 + 73492682991.
It is an arithmetic number, because the mean of its divisors is an integer number (73492682991).
Almost surely, 2146985365981 is an apocalyptic number.
It is an amenable number.
146985365981 is a deficient number, since it is larger than the sum of its proper divisors (1).
146985365981 is an equidigital number, since it uses as much as digits as its factorization.
146985365981 is an odious number, because the sum of its binary digits is odd.
The product of its digits is 55987200, while the sum is 65.
The spelling of 146985365981 in words is "one hundred forty-six billion, nine hundred eighty-five million, three hundred sixty-five thousand, nine hundred eighty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.066 sec. • engine limits •