Base | Representation |
---|---|
bin | 100000010010101110101010… |
… | …100000100111010010101111 |
3 | 200121212102011200102122011111 |
4 | 200102232222200213102233 |
5 | 122103412231312044403 |
6 | 1222021101440332451 |
7 | 41625635414352301 |
oct | 4022565240472257 |
9 | 617772150378144 |
10 | 142024544253103 |
11 | 412872a8727726 |
12 | 13b19384614127 |
13 | 6132b1ac4b855 |
14 | 271004b7ab971 |
15 | 11645b716556d |
hex | 812baa8274af |
142024544253103 has 2 divisors, whose sum is σ = 142024544253104. Its totient is φ = 142024544253102.
The previous prime is 142024544253083. The next prime is 142024544253133. The reversal of 142024544253103 is 301352445420241.
It is a weak prime.
It is an emirp because it is prime and its reverse (301352445420241) is a distict prime.
It is a cyclic number.
It is not a de Polignac number, because 142024544253103 - 217 = 142024544122031 is a prime.
It is a super-2 number, since 2×1420245442531032 (a number of 29 digits) contains 22 as substring.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (142024544253133) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 71012272126551 + 71012272126552.
It is an arithmetic number, because the mean of its divisors is an integer number (71012272126552).
Almost surely, 2142024544253103 is an apocalyptic number.
142024544253103 is a deficient number, since it is larger than the sum of its proper divisors (1).
142024544253103 is an equidigital number, since it uses as much as digits as its factorization.
142024544253103 is an evil number, because the sum of its binary digits is even.
The product of its (nonzero) digits is 460800, while the sum is 40.
Adding to 142024544253103 its reverse (301352445420241), we get a palindrome (443376989673344).
The spelling of 142024544253103 in words is "one hundred forty-two trillion, twenty-four billion, five hundred forty-four million, two hundred fifty-three thousand, one hundred three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.077 sec. • engine limits •