Base | Representation |
---|---|
bin | 1000001001101001110… |
… | …0100011110001100101 |
3 | 111101102221101201010022 |
4 | 2002122130203301211 |
5 | 4243240203200201 |
6 | 144155015404525 |
7 | 13055035322444 |
oct | 2023234436145 |
9 | 441387351108 |
10 | 140030131301 |
11 | 544283a4245 |
12 | 2317b983745 |
13 | 10287bb1978 |
14 | 6ac5632d5b |
15 | 39986c441b |
hex | 209a723c65 |
140030131301 has 2 divisors, whose sum is σ = 140030131302. Its totient is φ = 140030131300.
The previous prime is 140030131237. The next prime is 140030131349. The reversal of 140030131301 is 103131030041.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 118216318276 + 21813813025 = 343826^2 + 147695^2 .
It is a cyclic number.
It is not a de Polignac number, because 140030131301 - 26 = 140030131237 is a prime.
It is a self number, because there is not a number n which added to its sum of digits gives 140030131301.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (140030131361) 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 as a sum of consecutive naturals, namely, 70015065650 + 70015065651.
It is an arithmetic number, because the mean of its divisors is an integer number (70015065651).
Almost surely, 2140030131301 is an apocalyptic number.
It is an amenable number.
140030131301 is a deficient number, since it is larger than the sum of its proper divisors (1).
140030131301 is an equidigital number, since it uses as much as digits as its factorization.
140030131301 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 108, while the sum is 17.
Adding to 140030131301 its reverse (103131030041), we get a palindrome (243161161342).
The spelling of 140030131301 in words is "one hundred forty billion, thirty million, one hundred thirty-one thousand, three hundred one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •