Base | Representation |
---|---|
bin | 1000010001111000111… |
… | …1001110110101001001 |
3 | 111121011000222011112101 |
4 | 2010132033032311021 |
5 | 4312302223331103 |
6 | 145202243113401 |
7 | 13163604336001 |
oct | 2043617166511 |
9 | 447130864471 |
10 | 142241230153 |
11 | 55362514570 |
12 | 23698372861 |
13 | 1054accb099 |
14 | 6c5515d001 |
15 | 3a77884a1d |
hex | 211e3ced49 |
142241230153 has 8 divisors (see below), whose sum is σ = 161918870976. Its totient is φ = 123688026000.
The previous prime is 142241230133. The next prime is 142241230171. The reversal of 142241230153 is 351032142241.
142241230153 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is a sphenic number, since it is the product of 3 distinct primes.
It is not a de Polignac number, because 142241230153 - 25 = 142241230121 is a prime.
It is not an unprimeable number, because it can be changed into a prime (142241230133) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 281108898 + ... + 281109403.
It is an arithmetic number, because the mean of its divisors is an integer number (20239858872).
Almost surely, 2142241230153 is an apocalyptic number.
It is an amenable number.
142241230153 is a deficient number, since it is larger than the sum of its proper divisors (19677640823).
142241230153 is a wasteful number, since it uses less digits than its factorization.
142241230153 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 562218335.
The product of its (nonzero) digits is 5760, while the sum is 28.
Adding to 142241230153 its reverse (351032142241), we get a palindrome (493273372394).
The spelling of 142241230153 in words is "one hundred forty-two billion, two hundred forty-one million, two hundred thirty thousand, one hundred fifty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.075 sec. • engine limits •