Base | Representation |
---|---|
bin | 1000010001111100010… |
… | …0100011000011101011 |
3 | 111121012000021020122212 |
4 | 2010133010203003223 |
5 | 4312314313103020 |
6 | 145203502435335 |
7 | 13164134206523 |
oct | 2043704430353 |
9 | 447160236585 |
10 | 142255206635 |
11 | 5536a3a0283 |
12 | 236a0b92b4b |
13 | 10550b828a9 |
14 | 6c56d5a683 |
15 | 3a78be5cc5 |
hex | 211f1230eb |
142255206635 has 8 divisors (see below), whose sum is σ = 170791741296. Its totient is φ = 113747169760.
The previous prime is 142255206631. The next prime is 142255206673. The reversal of 142255206635 is 536602552241.
It is a sphenic number, since it is the product of 3 distinct primes.
It is not a de Polignac number, because 142255206635 - 22 = 142255206631 is a prime.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 142255206592 and 142255206601.
It is not an unprimeable number, because it can be changed into a prime (142255206631) 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 7 ways as a sum of consecutive naturals, for example, 7113461 + ... + 7133430.
It is an arithmetic number, because the mean of its divisors is an integer number (21348967662).
Almost surely, 2142255206635 is an apocalyptic number.
142255206635 is a deficient number, since it is larger than the sum of its proper divisors (28536534661).
142255206635 is a wasteful number, since it uses less digits than its factorization.
142255206635 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 14248893.
The product of its (nonzero) digits is 432000, while the sum is 41.
Adding to 142255206635 its reverse (536602552241), we get a palindrome (678857758876).
The spelling of 142255206635 in words is "one hundred forty-two billion, two hundred fifty-five million, two hundred six thousand, six hundred thirty-five".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •