Base | Representation |
---|---|
bin | 1000010010001001101… |
… | …1011101111011111111 |
3 | 111121022221021121121002 |
4 | 2010202123131323333 |
5 | 4312423223442443 |
6 | 145213234200515 |
7 | 13165420121201 |
oct | 2044233357377 |
9 | 447287247532 |
10 | 142311546623 |
11 | 55399181354 |
12 | 236b7a2313b |
13 | 1055c74a96c |
14 | 6c60624771 |
15 | 3a7db242b8 |
hex | 21226ddeff |
142311546623 has 4 divisors (see below), whose sum is σ = 142337422248. Its totient is φ = 142285671000.
The previous prime is 142311546617. The next prime is 142311546647. The reversal of 142311546623 is 326645113241.
It is a semiprime because it is the product of two primes, and also an emirpimes, since its reverse is a distinct semiprime: 326645113241 = 1783 ⋅183199727.
It is a cyclic number.
It is not a de Polignac number, because 142311546623 - 234 = 125131677439 is a prime.
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (142311542623) by changing a digit.
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 3 ways as a sum of consecutive naturals, for example, 12929561 + ... + 12940562.
It is an arithmetic number, because the mean of its divisors is an integer number (35584355562).
Almost surely, 2142311546623 is an apocalyptic number.
142311546623 is a deficient number, since it is larger than the sum of its proper divisors (25875625).
142311546623 is an equidigital number, since it uses as much as digits as its factorization.
142311546623 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 25875624.
The product of its digits is 103680, while the sum is 38.
Adding to 142311546623 its reverse (326645113241), we get a palindrome (468956659864).
The spelling of 142311546623 in words is "one hundred forty-two billion, three hundred eleven million, five hundred forty-six thousand, six hundred twenty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •