Base | Representation |
---|---|
bin | 1000010010100001110… |
… | …0110010011101100011 |
3 | 111121120222100102120222 |
4 | 2010220130302131203 |
5 | 4313130103244011 |
6 | 145231243153255 |
7 | 13201054516436 |
oct | 2045034623543 |
9 | 447528312528 |
10 | 142412556131 |
11 | 554401a228a |
12 | 2372581582b |
13 | 10577655ac1 |
14 | 6c6dbd981d |
15 | 3a87927ddb |
hex | 2128732763 |
142412556131 has 4 divisors (see below), whose sum is σ = 142441690200. Its totient is φ = 142383422064.
The previous prime is 142412556103. The next prime is 142412556149. The reversal of 142412556131 is 131655214241.
It is a happy number.
It is a semiprime because it is the product of two primes.
It is a cyclic number.
It is not a de Polignac number, because 142412556131 - 226 = 142345447267 is a prime.
It is a super-2 number, since 2×1424125561312 (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 = 142412556091 and 142412556100.
It is not an unprimeable number, because it can be changed into a prime (142412558131) 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 in 3 ways as a sum of consecutive naturals, for example, 14559701 + ... + 14569478.
It is an arithmetic number, because the mean of its divisors is an integer number (35610422550).
Almost surely, 2142412556131 is an apocalyptic number.
142412556131 is a deficient number, since it is larger than the sum of its proper divisors (29134069).
142412556131 is an equidigital number, since it uses as much as digits as its factorization.
142412556131 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 29134068.
The product of its digits is 28800, while the sum is 35.
The spelling of 142412556131 in words is "one hundred forty-two billion, four hundred twelve million, five hundred fifty-six thousand, one hundred thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •