Base | Representation |
---|---|
bin | 1000001010010111001… |
… | …0010010010010100111 |
3 | 111101221012101011002211 |
4 | 2002211302102102213 |
5 | 4244132404014411 |
6 | 144225533144251 |
7 | 13062535350415 |
oct | 2024562222247 |
9 | 441835334084 |
10 | 140220376231 |
11 | 54515824061 |
12 | 2321362b087 |
13 | 102b8431a30 |
14 | 6b029d62b5 |
15 | 39aa253221 |
hex | 20a5c924a7 |
140220376231 has 8 divisors (see below), whose sum is σ = 157572061920. Its totient is φ = 123806619552.
The previous prime is 140220376211. The next prime is 140220376237. The reversal of 140220376231 is 132673022041.
It is a happy number.
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 140220376231 - 25 = 140220376199 is a prime.
It is a super-2 number, since 2×1402203762312 (a number of 23 digits) contains 22 as substring.
It is a junction number, because it is equal to n+sod(n) for n = 140220376193 and 140220376202.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (140220376237) 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, 234481936 + ... + 234482533.
It is an arithmetic number, because the mean of its divisors is an integer number (19696507740).
Almost surely, 2140220376231 is an apocalyptic number.
140220376231 is a deficient number, since it is larger than the sum of its proper divisors (17351685689).
140220376231 is a wasteful number, since it uses less digits than its factorization.
140220376231 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 468964505.
The product of its (nonzero) digits is 12096, while the sum is 31.
Adding to 140220376231 its reverse (132673022041), we get a palindrome (272893398272).
The spelling of 140220376231 in words is "one hundred forty billion, two hundred twenty million, three hundred seventy-six thousand, two hundred thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •