Base | Representation |
---|---|
bin | 10001000000110… |
… | …01101000000101 |
3 | 100221112111002202 |
4 | 20200121220011 |
5 | 243013230201 |
6 | 22054444245 |
7 | 3352011635 |
oct | 1040315005 |
9 | 327474082 |
10 | 142711301 |
11 | 73614127 |
12 | 3b963685 |
13 | 23749475 |
14 | 14d4c6c5 |
15 | c7dec6b |
hex | 8819a05 |
142711301 has 2 divisors, whose sum is σ = 142711302. Its totient is φ = 142711300.
The previous prime is 142711249. The next prime is 142711307. The reversal of 142711301 is 103117241.
It is a happy number.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 99480676 + 43230625 = 9974^2 + 6575^2 .
It is an emirp because it is prime and its reverse (103117241) is a distict prime.
It is a cyclic number.
It is not a de Polignac number, because 142711301 - 26 = 142711237 is a prime.
It is a super-3 number, since 3×1427113013 (a number of 25 digits) contains 333 as substring. Note that it is a super-d number also for d = 2.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (142711307) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 71355650 + 71355651.
It is an arithmetic number, because the mean of its divisors is an integer number (71355651).
Almost surely, 2142711301 is an apocalyptic number.
It is an amenable number.
142711301 is a deficient number, since it is larger than the sum of its proper divisors (1).
142711301 is an equidigital number, since it uses as much as digits as its factorization.
142711301 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 168, while the sum is 20.
The square root of 142711301 is about 11946.1835328275. The cubic root of 142711301 is about 522.5800046901.
Adding to 142711301 its reverse (103117241), we get a palindrome (245828542).
The spelling of 142711301 in words is "one hundred forty-two million, seven hundred eleven thousand, three hundred one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.067 sec. • engine limits •