Base | Representation |
---|---|
bin | 1000001011000100111… |
… | …0000101000011010101 |
3 | 111102102120100101111120 |
4 | 2002301032011003111 |
5 | 4300031011231123 |
6 | 144300544554153 |
7 | 13100355050565 |
oct | 2026116050325 |
9 | 442376311446 |
10 | 140412211413 |
11 | 5460403a731 |
12 | 23267922959 |
13 | 103190ba886 |
14 | 6b20290da5 |
15 | 39bbee82e3 |
hex | 20b13850d5 |
140412211413 has 4 divisors (see below), whose sum is σ = 187216281888. Its totient is φ = 93608140940.
The previous prime is 140412211361. The next prime is 140412211447. The reversal of 140412211413 is 314112214041.
It is a happy number.
It is a semiprime because it is the product of two primes, and also a Blum integer, because the two primes are equal to 3 mod 4.
It is a cyclic number.
It is not a de Polignac number, because 140412211413 - 222 = 140408017109 is a prime.
It is a super-2 number, since 2×1404122114132 (a number of 23 digits) contains 22 as substring.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (140412211493) 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, 23402035233 + ... + 23402035238.
It is an arithmetic number, because the mean of its divisors is an integer number (46804070472).
Almost surely, 2140412211413 is an apocalyptic number.
It is an amenable number.
140412211413 is a deficient number, since it is larger than the sum of its proper divisors (46804070475).
140412211413 is an equidigital number, since it uses as much as digits as its factorization.
140412211413 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 46804070474.
The product of its (nonzero) digits is 768, while the sum is 24.
Adding to 140412211413 its reverse (314112214041), we get a palindrome (454524425454).
The spelling of 140412211413 in words is "one hundred forty billion, four hundred twelve million, two hundred eleven thousand, four hundred thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •