Base | Representation |
---|---|
bin | 1000010001011100010… |
… | …1010111001000110111 |
3 | 111120211200010010011210 |
4 | 2010113011113020313 |
5 | 4312031011432411 |
6 | 145142314332503 |
7 | 13160616200241 |
oct | 2042705271067 |
9 | 446750103153 |
10 | 142121202231 |
11 | 55300793838 |
12 | 2366412a133 |
13 | 1052c194548 |
14 | 6c43237091 |
15 | 3a6c075ca6 |
hex | 2117157237 |
142121202231 has 8 divisors (see below), whose sum is σ = 189497653120. Its totient is φ = 94746109752.
The previous prime is 142121202227. The next prime is 142121202233. The reversal of 142121202231 is 132202121241.
It is a happy number.
It is a sphenic number, since it is the product of 3 distinct primes.
It is not a de Polignac number, because 142121202231 - 22 = 142121202227 is a prime.
It is a super-2 number, since 2×1421212022312 (a number of 23 digits) contains 22 as substring.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 142121202198 and 142121202207.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (142121202233) by changing a digit.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 63385 + ... + 536898.
It is an arithmetic number, because the mean of its divisors is an integer number (23687206640).
Almost surely, 2142121202231 is an apocalyptic number.
142121202231 is a deficient number, since it is larger than the sum of its proper divisors (47376450889).
142121202231 is an equidigital number, since it uses as much as digits as its factorization.
142121202231 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 679205.
The product of its (nonzero) digits is 384, while the sum is 21.
Adding to 142121202231 its reverse (132202121241), we get a palindrome (274323323472).
The spelling of 142121202231 in words is "one hundred forty-two billion, one hundred twenty-one million, two hundred two thousand, two hundred thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •