Base | Representation |
---|---|
bin | 100000010010110100101101… |
… | …011010111101111011100011 |
3 | 200121220000221001221222002211 |
4 | 200102310231122331323203 |
5 | 122104014030100234210 |
6 | 1222024053523422551 |
7 | 41626255315461316 |
oct | 4022645532757343 |
9 | 617800831858084 |
10 | 142031035555555 |
11 | 4128a0299142a3 |
12 | 13b1a696524a57 |
13 | 6133613a45913 |
14 | 27104a594a97d |
15 | 1164846e9938a |
hex | 812d2d6bdee3 |
142031035555555 has 4 divisors (see below), whose sum is σ = 170437242666672. Its totient is φ = 113624828444440.
The previous prime is 142031035555553. The next prime is 142031035555589. The reversal of 142031035555555 is 555555530130241.
It is a semiprime because it is the product of two primes.
It is not a de Polignac number, because 142031035555555 - 21 = 142031035555553 is a prime.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 142031035555499 and 142031035555508.
It is not an unprimeable number, because it can be changed into a prime (142031035555553) by changing a digit.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 14203103555551 + ... + 14203103555560.
It is an arithmetic number, because the mean of its divisors is an integer number (42609310666668).
Almost surely, 2142031035555555 is an apocalyptic number.
142031035555555 is a deficient number, since it is larger than the sum of its proper divisors (28406207111117).
142031035555555 is an equidigital number, since it uses as much as digits as its factorization.
142031035555555 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 28406207111116.
The product of its (nonzero) digits is 5625000, while the sum is 49.
Adding to 142031035555555 its reverse (555555530130241), we get a palindrome (697586565685796).
The spelling of 142031035555555 in words is "one hundred forty-two trillion, thirty-one billion, thirty-five million, five hundred fifty-five thousand, five hundred fifty-five".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •