Base | Representation |
---|---|
bin | 11111111011011000010100… |
… | …010011011111111101101001 |
3 | 200102012000120100000220100121 |
4 | 133323120110103133331221 |
5 | 121401120130331301101 |
6 | 1214352020315203241 |
7 | 41402003352405136 |
oct | 3773302423377551 |
9 | 612160510026317 |
10 | 140420001431401 |
11 | 4081887408003a |
12 | 138ba406446521 |
13 | 604771ab08043 |
14 | 2696515a2958d |
15 | 11379a6d350a1 |
hex | 7fb6144dff69 |
140420001431401 has 4 divisors (see below), whose sum is σ = 140420052753552. Its totient is φ = 140419950109252.
The previous prime is 140420001431357. The next prime is 140420001431447. The reversal of 140420001431401 is 104134100024041.
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 140420001431401 - 27 = 140420001431273 is a prime.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (140420001491401) 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, 21311215 + ... + 27111028.
It is an arithmetic number, because the mean of its divisors is an integer number (35105013188388).
Almost surely, 2140420001431401 is an apocalyptic number.
It is an amenable number.
140420001431401 is a deficient number, since it is larger than the sum of its proper divisors (51322151).
140420001431401 is an equidigital number, since it uses as much as digits as its factorization.
140420001431401 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 51322150.
The product of its (nonzero) digits is 1536, while the sum is 25.
Adding to 140420001431401 its reverse (104134100024041), we get a palindrome (244554101455442).
The spelling of 140420001431401 in words is "one hundred forty trillion, four hundred twenty billion, one million, four hundred thirty-one thousand, four hundred one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.089 sec. • engine limits •