Base | Representation |
---|---|
bin | 100000010100001100100001… |
… | …010110111100100000000011 |
3 | 200122020001022002101201210021 |
4 | 200110030201112330200003 |
5 | 122112040130022030133 |
6 | 1222135245523114311 |
7 | 41636133661056154 |
oct | 4024144126744003 |
9 | 618201262351707 |
10 | 142125322455043 |
11 | 41316013365424 |
12 | 13b34a0ab12997 |
13 | 613c48ba4b4c5 |
14 | 2714c8bd2192b |
15 | 116701486d52d |
hex | 8143215bc803 |
142125322455043 has 2 divisors, whose sum is σ = 142125322455044. Its totient is φ = 142125322455042.
The previous prime is 142125322454963. The next prime is 142125322455097. The reversal of 142125322455043 is 340554223521241.
It is a strong prime.
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-142125322455043 is a prime.
It is a super-2 number, since 2×1421253224550432 (a number of 29 digits) contains 22 as substring.
It is not a weakly prime, because it can be changed into another prime (142125322455143) 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, 71062661227521 + 71062661227522.
It is an arithmetic number, because the mean of its divisors is an integer number (71062661227522).
Almost surely, 2142125322455043 is an apocalyptic number.
142125322455043 is a deficient number, since it is larger than the sum of its proper divisors (1).
142125322455043 is an equidigital number, since it uses as much as digits as its factorization.
142125322455043 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 1152000, while the sum is 43.
Adding to 142125322455043 its reverse (340554223521241), we get a palindrome (482679545976284).
The spelling of 142125322455043 in words is "one hundred forty-two trillion, one hundred twenty-five billion, three hundred twenty-two million, four hundred fifty-five thousand, forty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •