Base | Representation |
---|---|
bin | 1000001010101111110… |
… | …1111101110000001011 |
3 | 111102012102112220220210 |
4 | 2002223331331300023 |
5 | 4244340432214011 |
6 | 144244120252203 |
7 | 13065235115364 |
oct | 2025375756013 |
9 | 442172486823 |
10 | 140324101131 |
11 | 5456932a115 |
12 | 23242311063 |
13 | 10303a7ab06 |
14 | 6b126b6b6b |
15 | 39b43e16a6 |
hex | 20abf7dc0b |
140324101131 has 16 divisors (see below), whose sum is σ = 191092220928. Its totient is φ = 91552953600.
The previous prime is 140324101129. The next prime is 140324101189. The reversal of 140324101131 is 131101423041.
It is not a de Polignac number, because 140324101131 - 21 = 140324101129 is a prime.
It is a super-2 number, since 2×1403241011312 (a number of 23 digits) contains 22 as substring.
It is a junction number, because it is equal to n+sod(n) for n = 140324101098 and 140324101107.
It is not an unprimeable number, because it can be changed into a prime (140324102131) by changing a digit.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 3339291 + ... + 3381051.
It is an arithmetic number, because the mean of its divisors is an integer number (11943263808).
Almost surely, 2140324101131 is an apocalyptic number.
140324101131 is a deficient number, since it is larger than the sum of its proper divisors (50768119797).
140324101131 is a wasteful number, since it uses less digits than its factorization.
140324101131 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 65642.
The product of its (nonzero) digits is 288, while the sum is 21.
Adding to 140324101131 its reverse (131101423041), we get a palindrome (271425524172).
The spelling of 140324101131 in words is "one hundred forty billion, three hundred twenty-four million, one hundred one thousand, one hundred thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •