Base | Representation |
---|---|
bin | 1000010010000000001… |
… | …0101111100001101011 |
3 | 111121020010221120112201 |
4 | 2010200002233201223 |
5 | 4312333001320020 |
6 | 145205244121031 |
7 | 13164422613202 |
oct | 2044002574153 |
9 | 447203846481 |
10 | 142271510635 |
11 | 55378616761 |
12 | 236a6536177 |
13 | 10554370927 |
14 | 6c591a2239 |
15 | 3a7a366a0a |
hex | 21200af86b |
142271510635 has 4 divisors (see below), whose sum is σ = 170725812768. Its totient is φ = 113817208504.
The previous prime is 142271510627. The next prime is 142271510707. The reversal of 142271510635 is 536015172241.
It is a semiprime because it is the product of two primes, and also an emirpimes, since its reverse is a distinct semiprime: 536015172241 = 52747 ⋅10162003.
It is a cyclic number.
It is not a de Polignac number, because 142271510635 - 23 = 142271510627 is a prime.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 142271510594 and 142271510603.
It is an unprimeable number.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 14227151059 + ... + 14227151068.
It is an arithmetic number, because the mean of its divisors is an integer number (42681453192).
Almost surely, 2142271510635 is an apocalyptic number.
142271510635 is a deficient number, since it is larger than the sum of its proper divisors (28454302133).
142271510635 is an equidigital number, since it uses as much as digits as its factorization.
142271510635 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 28454302132.
The product of its (nonzero) digits is 50400, while the sum is 37.
Adding to 142271510635 its reverse (536015172241), we get a palindrome (678286682876).
The spelling of 142271510635 in words is "one hundred forty-two billion, two hundred seventy-one million, five hundred ten thousand, six hundred thirty-five".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •