Base | Representation |
---|---|
bin | 1000001001111101001… |
… | …0101100111000001001 |
3 | 111101122121101021101200 |
4 | 2002133102230320021 |
5 | 4243422011330400 |
6 | 144211042134413 |
7 | 13060043350341 |
oct | 2023722547011 |
9 | 441577337350 |
10 | 140111433225 |
11 | 5446a284615 |
12 | 231a3051409 |
13 | 1029b9a980a |
14 | 6ad2357d21 |
15 | 39a08d3b00 |
hex | 209f4ace09 |
140111433225 has 18 divisors (see below), whose sum is σ = 250955145246. Its totient is φ = 74726097600.
The previous prime is 140111433211. The next prime is 140111433347. The reversal of 140111433225 is 522334111041.
140111433225 is a `hidden beast` number, since 1 + 4 + 0 + 1 + 1 + 1 + 433 + 225 = 666.
It can be written as a sum of positive squares in 3 ways, for example, as 19516369401 + 120595063824 = 139701^2 + 347268^2 .
It is not a de Polignac number, because 140111433225 - 225 = 140077878793 is a prime.
It is an unprimeable number.
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 in 17 ways as a sum of consecutive naturals, for example, 311358516 + ... + 311358965.
Almost surely, 2140111433225 is an apocalyptic number.
140111433225 is a gapful number since it is divisible by the number (15) formed by its first and last digit.
It is an amenable number.
140111433225 is a deficient number, since it is larger than the sum of its proper divisors (110843712021).
140111433225 is a wasteful number, since it uses less digits than its factorization.
140111433225 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 622717497 (or 622717489 counting only the distinct ones).
The product of its (nonzero) digits is 2880, while the sum is 27.
Adding to 140111433225 its reverse (522334111041), we get a palindrome (662445544266).
The spelling of 140111433225 in words is "one hundred forty billion, one hundred eleven million, four hundred thirty-three thousand, two hundred twenty-five".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.074 sec. • engine limits •