Base | Representation |
---|---|
bin | 1000001011011111001… |
… | …0011111111100001111 |
3 | 111102201020201200001022 |
4 | 2002313302133330033 |
5 | 4300242220001111 |
6 | 144315523104355 |
7 | 13103163610415 |
oct | 2026762377417 |
9 | 442636650038 |
10 | 140522422031 |
11 | 54660275592 |
12 | 232988120bb |
13 | 10335b97a64 |
14 | 6b30b7d2b5 |
15 | 39c6a182db |
hex | 20b7c9ff0f |
140522422031 has 8 divisors (see below), whose sum is σ = 147983460720. Its totient is φ = 133067895552.
The previous prime is 140522422021. The next prime is 140522422141. The reversal of 140522422031 is 130224225041.
It is a sphenic number, since it is the product of 3 distinct primes.
It is a cyclic number.
It is not a de Polignac number, because 140522422031 - 230 = 139448680207 is a prime.
It is a super-2 number, since 2×1405224220312 (a number of 23 digits) contains 22 as substring.
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (140522422021) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (23) of ones.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 1583720 + ... + 1670093.
It is an arithmetic number, because the mean of its divisors is an integer number (18497932590).
Almost surely, 2140522422031 is an apocalyptic number.
140522422031 is a deficient number, since it is larger than the sum of its proper divisors (7461038689).
140522422031 is a wasteful number, since it uses less digits than its factorization.
140522422031 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 3256105.
The product of its (nonzero) digits is 3840, while the sum is 26.
Adding to 140522422031 its reverse (130224225041), we get a palindrome (270746647072).
The spelling of 140522422031 in words is "one hundred forty billion, five hundred twenty-two million, four hundred twenty-two thousand, thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.066 sec. • engine limits •