Base | Representation |
---|---|
bin | 1000001101110010100… |
… | …0001000101000111001 |
3 | 111111022022200100200121 |
4 | 2003130220020220321 |
5 | 4303023424242022 |
6 | 144501121533241 |
7 | 13124410063543 |
oct | 2033450105071 |
9 | 444268610617 |
10 | 141140462137 |
11 | 54948125234 |
12 | 2342b7a4221 |
13 | 10403c3b96c |
14 | 6b8cca0693 |
15 | 3a10deb2c7 |
hex | 20dca08a39 |
141140462137 has 2 divisors, whose sum is σ = 141140462138. Its totient is φ = 141140462136.
The previous prime is 141140462131. The next prime is 141140462171. The reversal of 141140462137 is 731264041141.
It is an a-pointer prime, because the next prime (141140462171) can be obtained adding 141140462137 to its sum of digits (34).
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 126434291776 + 14706170361 = 355576^2 + 121269^2 .
It is a cyclic number.
It is not a de Polignac number, because 141140462137 - 227 = 141006244409 is a prime.
It is not a weakly prime, because it can be changed into another prime (141140462131) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 70570231068 + 70570231069.
It is an arithmetic number, because the mean of its divisors is an integer number (70570231069).
Almost surely, 2141140462137 is an apocalyptic number.
It is an amenable number.
141140462137 is a deficient number, since it is larger than the sum of its proper divisors (1).
141140462137 is an equidigital number, since it uses as much as digits as its factorization.
141140462137 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 16128, while the sum is 34.
The spelling of 141140462137 in words is "one hundred forty-one billion, one hundred forty million, four hundred sixty-two thousand, one hundred thirty-seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.076 sec. • engine limits •