Base | Representation |
---|---|
bin | 1000001001110001001… |
… | …0101101000111011001 |
3 | 111101112002200012200201 |
4 | 2002130102231013121 |
5 | 4243321120240203 |
6 | 144202043302201 |
7 | 13055562504601 |
oct | 2023422550731 |
9 | 441462605621 |
10 | 140061102553 |
11 | 54443928419 |
12 | 2318a21a961 |
13 | 10291436a58 |
14 | 6ac97b5c01 |
15 | 399b290e1d |
hex | 209c4ad1d9 |
140061102553 has 2 divisors, whose sum is σ = 140061102554. Its totient is φ = 140061102552.
The previous prime is 140061102541. The next prime is 140061102583. The reversal of 140061102553 is 355201160041.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 92472552649 + 47588549904 = 304093^2 + 218148^2 .
It is a cyclic number.
It is not a de Polignac number, because 140061102553 - 229 = 139524231641 is a prime.
It is a super-2 number, since 2×1400611025532 (a number of 23 digits) contains 22 as substring.
It is not a weakly prime, because it can be changed into another prime (140061102583) 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, 70030551276 + 70030551277.
It is an arithmetic number, because the mean of its divisors is an integer number (70030551277).
Almost surely, 2140061102553 is an apocalyptic number.
It is an amenable number.
140061102553 is a deficient number, since it is larger than the sum of its proper divisors (1).
140061102553 is an equidigital number, since it uses as much as digits as its factorization.
140061102553 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 3600, while the sum is 28.
Adding to 140061102553 its reverse (355201160041), we get a palindrome (495262262594).
The spelling of 140061102553 in words is "one hundred forty billion, sixty-one million, one hundred two thousand, five hundred fifty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.092 sec. • engine limits •