Base | Representation |
---|---|
bin | 1000010010010000110… |
… | …1101111001011100010 |
3 | 111121102000122111012010 |
4 | 2010210031233023202 |
5 | 4313003411023131 |
6 | 145220224213350 |
7 | 13166232541530 |
oct | 2044415571342 |
9 | 447360574163 |
10 | 142341501666 |
11 | 55404080a91 |
12 | 23705a6a256 |
13 | 10565a08340 |
14 | 6c645c1150 |
15 | 3a8158eb46 |
hex | 212436f2e2 |
142341501666 has 64 divisors (see below), whose sum is σ = 365612986368. Its totient is φ = 35908411968.
The previous prime is 142341501661. The next prime is 142341501671. The reversal of 142341501666 is 666105143241.
It is an interprime number because it is at equal distance from previous prime (142341501661) and next prime (142341501671).
It is a super-2 number, since 2×1423415016662 (a number of 23 digits) contains 22 as substring.
It is a Harshad number since it is a multiple of its sum of digits (39).
It is a Curzon number.
It is not an unprimeable number, because it can be changed into a prime (142341501661) 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 31 ways as a sum of consecutive naturals, for example, 5654806 + ... + 5679921.
It is an arithmetic number, because the mean of its divisors is an integer number (5712702912).
Almost surely, 2142341501666 is an apocalyptic number.
142341501666 is an abundant number, since it is smaller than the sum of its proper divisors (223271484702).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
142341501666 is a wasteful number, since it uses less digits than its factorization.
142341501666 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 11334775.
The product of its (nonzero) digits is 103680, while the sum is 39.
The spelling of 142341501666 in words is "one hundred forty-two billion, three hundred forty-one million, five hundred one thousand, six hundred sixty-six".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.243 sec. • engine limits •