Base | Representation |
---|---|
bin | 100000010100001100100001… |
… | …010110111100011111011101 |
3 | 200122020001022002101201201212 |
4 | 200110030201112330133131 |
5 | 122112040130022030010 |
6 | 1222135245523114205 |
7 | 41636133661056101 |
oct | 4024144126743735 |
9 | 618201262351655 |
10 | 142125322455005 |
11 | 4131601336539a |
12 | 13b34a0ab12965 |
13 | 613c48ba4b496 |
14 | 2714c8bd21901 |
15 | 116701486d505 |
hex | 8143215bc7dd |
142125322455005 has 8 divisors (see below), whose sum is σ = 170553612314592. Its totient is φ = 113698107718288.
The previous prime is 142125322454963. The next prime is 142125322455043. The reversal of 142125322455005 is 500554223521241.
It is a sphenic number, since it is the product of 3 distinct primes.
It is a cyclic number.
It is not a de Polignac number, because 142125322455005 - 216 = 142125322389469 is a prime.
It is a Duffinian number.
It is a congruent number.
It is an unprimeable number.
It is a pernicious number, because its binary representation contains a prime number (23) of ones.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 268489859 + ... + 269018688.
It is an arithmetic number, because the mean of its divisors is an integer number (21319201539324).
Almost surely, 2142125322455005 is an apocalyptic number.
It is an amenable number.
142125322455005 is a deficient number, since it is larger than the sum of its proper divisors (28428289859587).
142125322455005 is an equidigital number, since it uses as much as digits as its factorization.
142125322455005 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 537561435.
The product of its (nonzero) digits is 480000, while the sum is 41.
Adding to 142125322455005 its reverse (500554223521241), we get a palindrome (642679545976246).
The spelling of 142125322455005 in words is "one hundred forty-two trillion, one hundred twenty-five billion, three hundred twenty-two million, four hundred fifty-five thousand, five".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •