Base | Representation |
---|---|
bin | 100000010101011011111100… |
… | …100111010110111000111001 |
3 | 200122112012102121012111021122 |
4 | 200111123330213112320321 |
5 | 122114434304432040421 |
6 | 1222242352235315025 |
7 | 41645243241510236 |
oct | 4025337447267071 |
9 | 618465377174248 |
10 | 142210605346361 |
11 | 413491a7327992 |
12 | 13b4944bbaba75 |
13 | 61475304cc5c6 |
14 | 271905c55a78d |
15 | 1169356a232ab |
hex | 8156fc9d6e39 |
142210605346361 has 4 divisors (see below), whose sum is σ = 142932486591972. Its totient is φ = 141488724100752.
The previous prime is 142210605346343. The next prime is 142210605346363. The reversal of 142210605346361 is 163643506012241.
It is a semiprime because it is the product of two primes.
It can be written as a sum of positive squares in 2 ways, for example, as 136713831315961 + 5496774030400 = 11692469^2 + 2344520^2 .
It is a cyclic number.
It is not a de Polignac number, because 142210605346361 - 210 = 142210605345337 is a prime.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (142210605346363) by changing a digit.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 360940622510 + ... + 360940622903.
It is an arithmetic number, because the mean of its divisors is an integer number (35733121647993).
Almost surely, 2142210605346361 is an apocalyptic number.
It is an amenable number.
142210605346361 is a deficient number, since it is larger than the sum of its proper divisors (721881245611).
142210605346361 is an equidigital number, since it uses as much as digits as its factorization.
142210605346361 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 721881245610.
The product of its (nonzero) digits is 622080, while the sum is 44.
The spelling of 142210605346361 in words is "one hundred forty-two trillion, two hundred ten billion, six hundred five million, three hundred forty-six thousand, three hundred sixty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.025 sec. • engine limits •