Base | Representation |
---|---|
bin | 1000010010100001100… |
… | …1011010011000000111 |
3 | 111121120220200110111002 |
4 | 2010220121122120013 |
5 | 4313124341433142 |
6 | 145231212203515 |
7 | 13201044142142 |
oct | 2045031323007 |
9 | 447526613432 |
10 | 142411671047 |
11 | 5543a748308 |
12 | 2372546959b |
13 | 10577405c99 |
14 | 6c6da49059 |
15 | 3a87800a32 |
hex | 212865a607 |
142411671047 has 2 divisors, whose sum is σ = 142411671048. Its totient is φ = 142411671046.
The previous prime is 142411671041. The next prime is 142411671053. The reversal of 142411671047 is 740176114241.
It is a happy number.
It is a balanced prime because it is at equal distance from previous prime (142411671041) and next prime (142411671053).
It is an emirp because it is prime and its reverse (740176114241) is a distict prime.
It is a cyclic number.
It is not a de Polignac number, because 142411671047 - 26 = 142411670983 is a prime.
It is a self number, because there is not a number n which added to its sum of digits gives 142411671047.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (142411671041) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 71205835523 + 71205835524.
It is an arithmetic number, because the mean of its divisors is an integer number (71205835524).
Almost surely, 2142411671047 is an apocalyptic number.
142411671047 is a deficient number, since it is larger than the sum of its proper divisors (1).
142411671047 is an equidigital number, since it uses as much as digits as its factorization.
142411671047 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 37632, while the sum is 38.
Adding to 142411671047 its reverse (740176114241), we get a palindrome (882587785288).
The spelling of 142411671047 in words is "one hundred forty-two billion, four hundred eleven million, six hundred seventy-one thousand, forty-seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.170 sec. • engine limits •