Base | Representation |
---|---|
bin | 100000010110111001000010… |
… | …011111101011011000010011 |
3 | 200122212202102202020220101112 |
4 | 200112321002133223120103 |
5 | 122123104012332023232 |
6 | 1222400323013123535 |
7 | 41655412251104006 |
oct | 4026710237533023 |
9 | 618782382226345 |
10 | 142310561986067 |
11 | 41387630237832 |
12 | 13b648a73295ab |
13 | 6153aa0039b67 |
14 | 271dc2193153d |
15 | 116bc570454b2 |
hex | 816e427eb613 |
142310561986067 has 2 divisors, whose sum is σ = 142310561986068. Its totient is φ = 142310561986066.
The previous prime is 142310561986057. The next prime is 142310561986091. The reversal of 142310561986067 is 760689165013241.
It is a weak prime.
It is a cyclic number.
It is not a de Polignac number, because 142310561986067 - 210 = 142310561985043 is a prime.
It is a junction number, because it is equal to n+sod(n) for n = 142310561985997 and 142310561986015.
It is not a weakly prime, because it can be changed into another prime (142310561986057) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (23) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 71155280993033 + 71155280993034.
It is an arithmetic number, because the mean of its divisors is an integer number (71155280993034).
It is a 1-persistent number, because it is pandigital, but 2⋅142310561986067 = 284621123972134 is not.
Almost surely, 2142310561986067 is an apocalyptic number.
142310561986067 is a deficient number, since it is larger than the sum of its proper divisors (1).
142310561986067 is an equidigital number, since it uses as much as digits as its factorization.
142310561986067 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 13063680, while the sum is 59.
The spelling of 142310561986067 in words is "one hundred forty-two trillion, three hundred ten billion, five hundred sixty-one million, nine hundred eighty-six thousand, sixty-seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.079 sec. • engine limits •