Base | Representation |
---|---|
bin | 11111111001101100011111… |
… | …110111001010110000110011 |
3 | 200101202221202002221111221210 |
4 | 133321230133313022300303 |
5 | 121342221031142323011 |
6 | 1214222512441451203 |
7 | 41360434433655615 |
oct | 3771543767126063 |
9 | 611687662844853 |
10 | 140304231214131 |
11 | 40783765884326 |
12 | 1389ba971a0b03 |
13 | 603982b0267ba |
14 | 2690a9236cdb5 |
15 | 113497d3936a6 |
hex | 7f9b1fdcac33 |
140304231214131 has 8 divisors (see below), whose sum is σ = 187072367818960. Its totient is φ = 93536124376032.
The previous prime is 140304231214127. The next prime is 140304231214153. The reversal of 140304231214131 is 131412132403041.
It is a sphenic number, since it is the product of 3 distinct primes.
It is not a de Polignac number, because 140304231214131 - 22 = 140304231214127 is a prime.
It is a super-2 number, since 2×1403042312141312 (a number of 29 digits) contains 22 as substring.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (140304231214331) by changing a digit.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 8333901 + ... + 18709953.
It is an arithmetic number, because the mean of its divisors is an integer number (23384045977370).
Almost surely, 2140304231214131 is an apocalyptic number.
140304231214131 is a deficient number, since it is larger than the sum of its proper divisors (46768136604829).
140304231214131 is a wasteful number, since it uses less digits than its factorization.
140304231214131 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 14883365.
The product of its (nonzero) digits is 6912, while the sum is 30.
Adding to 140304231214131 its reverse (131412132403041), we get a palindrome (271716363617172).
The spelling of 140304231214131 in words is "one hundred forty trillion, three hundred four billion, two hundred thirty-one million, two hundred fourteen thousand, one hundred thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.090 sec. • engine limits •