Base | Representation |
---|---|
bin | 1000001101010001110… |
… | …1000001001000110101 |
3 | 111110221202122022220022 |
4 | 2003110131001020311 |
5 | 4302233323030401 |
6 | 144435342414525 |
7 | 13121123346644 |
oct | 2032435011065 |
9 | 443852568808 |
10 | 141003330101 |
11 | 54887781977 |
12 | 233b1891445 |
13 | 103b16c6b4a |
14 | 6b789a535b |
15 | 3a03d5e71b |
hex | 20d4741235 |
141003330101 has 2 divisors, whose sum is σ = 141003330102. Its totient is φ = 141003330100.
The previous prime is 141003330077. The next prime is 141003330107. The reversal of 141003330101 is 101033300141.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 136242192100 + 4761138001 = 369110^2 + 69001^2 .
It is an emirp because it is prime and its reverse (101033300141) is a distict prime.
It is a cyclic number.
It is not a de Polignac number, because 141003330101 - 26 = 141003330037 is a prime.
It is a self number, because there is not a number n which added to its sum of digits gives 141003330101.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (141003330107) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 70501665050 + 70501665051.
It is an arithmetic number, because the mean of its divisors is an integer number (70501665051).
Almost surely, 2141003330101 is an apocalyptic number.
It is an amenable number.
141003330101 is a deficient number, since it is larger than the sum of its proper divisors (1).
141003330101 is an equidigital number, since it uses as much as digits as its factorization.
141003330101 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 141003330101 its reverse (101033300141), we get a palindrome (242036630242).
The spelling of 141003330101 in words is "one hundred forty-one billion, three million, three hundred thirty thousand, one hundred one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.123 sec. • engine limits •