Base | Representation |
---|---|
bin | 100000010111000010110010… |
… | …000001110100001100000011 |
3 | 200122220202102210202121121211 |
4 | 200113002302001310030003 |
5 | 122123241423410444421 |
6 | 1222405213032030551 |
7 | 41656232425333600 |
oct | 4027026201641403 |
9 | 618822383677554 |
10 | 142321023140611 |
11 | 41391009296aa7 |
12 | 13b66926832457 |
13 | 6154a7942b233 |
14 | 27205350176a7 |
15 | 116c16a6469e1 |
hex | 8170b2074303 |
142321023140611 has 48 divisors (see below), whose sum is σ = 168257139286656. Its totient is φ = 120004996535424.
The previous prime is 142321023140609. The next prime is 142321023140773. The reversal of 142321023140611 is 116041320123241.
It is a happy number.
It is not a de Polignac number, because 142321023140611 - 21 = 142321023140609 is a prime.
It is not an unprimeable number, because it can be changed into a prime (142321023140311) 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 47 ways as a sum of consecutive naturals, for example, 18958438120 + ... + 18958445626.
It is an arithmetic number, because the mean of its divisors is an integer number (3505357068472).
Almost surely, 2142321023140611 is an apocalyptic number.
142321023140611 is a deficient number, since it is larger than the sum of its proper divisors (25936116146045).
142321023140611 is an equidigital number, since it uses as much as digits as its factorization.
142321023140611 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 14688 (or 14681 counting only the distinct ones).
The product of its (nonzero) digits is 6912, while the sum is 31.
Adding to 142321023140611 its reverse (116041320123241), we get a palindrome (258362343263852).
The spelling of 142321023140611 in words is "one hundred forty-two trillion, three hundred twenty-one billion, twenty-three million, one hundred forty thousand, six hundred eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.075 sec. • engine limits •