Base | Representation |
---|---|
bin | 1000001010000110100… |
… | …1110010100000011111 |
3 | 111101202100220111201102 |
4 | 2002201221302200133 |
5 | 4244012131240111 |
6 | 144215015103315 |
7 | 13061034120152 |
oct | 2024151624037 |
9 | 441670814642 |
10 | 140151040031 |
11 | 5448a676812 |
12 | 231b4371b3b |
13 | 102a6c663b2 |
14 | 6ad7707c99 |
15 | 39a410913b |
hex | 20a1a7281f |
140151040031 has 4 divisors (see below), whose sum is σ = 140646273672. Its totient is φ = 139655806392.
The previous prime is 140151039983. The next prime is 140151040067. The reversal of 140151040031 is 130040151041.
It is a happy number.
It is a semiprime because it is the product of two primes.
It is a cyclic number.
It is not a de Polignac number, because 140151040031 - 26 = 140151039967 is a prime.
It is a super-2 number, since 2×1401510400312 (a number of 23 digits) contains 22 as substring.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 140151039985 and 140151040012.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (140151040531) by changing a digit.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 247616396 + ... + 247616961.
It is an arithmetic number, because the mean of its divisors is an integer number (35161568418).
Almost surely, 2140151040031 is an apocalyptic number.
140151040031 is a deficient number, since it is larger than the sum of its proper divisors (495233641).
140151040031 is an equidigital number, since it uses as much as digits as its factorization.
140151040031 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 495233640.
The product of its (nonzero) digits is 240, while the sum is 20.
Adding to 140151040031 its reverse (130040151041), we get a palindrome (270191191072).
The spelling of 140151040031 in words is "one hundred forty billion, one hundred fifty-one million, forty thousand, thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •