Base | Representation |
---|---|
bin | 100000010100010001000000… |
… | …000110101001010011110011 |
3 | 200122020111201100202002101120 |
4 | 200110101000012221103303 |
5 | 122112130003102234443 |
6 | 1222141403135033323 |
7 | 41636364125100324 |
oct | 4024210006512363 |
9 | 618214640662346 |
10 | 142130133243123 |
11 | 41318061988743 |
12 | 13b3593206b843 |
13 | 613ca7762c27c |
14 | 27151c6c0c44b |
15 | 11671e6d9c083 |
hex | 8144401a94f3 |
142130133243123 has 8 divisors (see below), whose sum is σ = 189509694360000. Its totient is φ = 94751997144168.
The previous prime is 142130133243107. The next prime is 142130133243149. The reversal of 142130133243123 is 321342331031241.
It is a sphenic number, since it is the product of 3 distinct primes.
It is not a de Polignac number, because 142130133243123 - 24 = 142130133243107 is a prime.
It is not an unprimeable number, because it can be changed into a prime (142130133243323) 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, 356021733 + ... + 356420726.
It is an arithmetic number, because the mean of its divisors is an integer number (23688711795000).
Almost surely, 2142130133243123 is an apocalyptic number.
142130133243123 is a deficient number, since it is larger than the sum of its proper divisors (47379561116877).
142130133243123 is an equidigital number, since it uses as much as digits as its factorization.
142130133243123 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 712508961.
The product of its (nonzero) digits is 31104, while the sum is 33.
Adding to 142130133243123 its reverse (321342331031241), we get a palindrome (463472464274364).
The spelling of 142130133243123 in words is "one hundred forty-two trillion, one hundred thirty billion, one hundred thirty-three million, two hundred forty-three thousand, one hundred twenty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.076 sec. • engine limits •