Base | Representation |
---|---|
bin | 1000001101011001000… |
… | …0100010111110011001 |
3 | 111111000212121222022202 |
4 | 2003112100202332121 |
5 | 4302314101142012 |
6 | 144442343455545 |
7 | 13121641643603 |
oct | 2032620427631 |
9 | 444025558282 |
10 | 141033615257 |
11 | 548a2887627 |
12 | 233bba575b5 |
13 | 103b7a6b862 |
14 | 6b7ca0a173 |
15 | 3a06842cc2 |
hex | 20d6422f99 |
141033615257 has 2 divisors, whose sum is σ = 141033615258. Its totient is φ = 141033615256.
The previous prime is 141033615251. The next prime is 141033615271. The reversal of 141033615257 is 752516330141.
It is a happy number.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 106038804496 + 34994810761 = 325636^2 + 187069^2 .
It is a cyclic number.
It is not a de Polignac number, because 141033615257 - 24 = 141033615241 is a prime.
It is a self number, because there is not a number n which added to its sum of digits gives 141033615257.
It is not a weakly prime, because it can be changed into another prime (141033615251) 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, 70516807628 + 70516807629.
It is an arithmetic number, because the mean of its divisors is an integer number (70516807629).
Almost surely, 2141033615257 is an apocalyptic number.
It is an amenable number.
141033615257 is a deficient number, since it is larger than the sum of its proper divisors (1).
141033615257 is an equidigital number, since it uses as much as digits as its factorization.
141033615257 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 75600, while the sum is 38.
Adding to 141033615257 its reverse (752516330141), we get a palindrome (893549945398).
The spelling of 141033615257 in words is "one hundred forty-one billion, thirty-three million, six hundred fifteen thousand, two hundred fifty-seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.090 sec. • engine limits •