Base | Representation |
---|---|
bin | 10100110111100100101… |
… | …001100110011011001111 |
3 | 12002002120010022020202121 |
4 | 110313210221212123033 |
5 | 141443423404020421 |
6 | 3014444223233411 |
7 | 205415230514221 |
oct | 24674451463317 |
9 | 5062503266677 |
10 | 1434060220111 |
11 | 5031aa676832 |
12 | 1b1b1ba48867 |
13 | a530121687c |
14 | 4d5a1da2411 |
15 | 27483456d41 |
hex | 14de4a666cf |
1434060220111 has 16 divisors (see below), whose sum is σ = 1478983828608. Its totient is φ = 1389668061600.
The previous prime is 1434060220063. The next prime is 1434060220127. The reversal of 1434060220111 is 1110220604341.
It is a cyclic number.
It is not a de Polignac number, because 1434060220111 - 219 = 1434059695823 is a prime.
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (1434060220511) 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 15 ways as a sum of consecutive naturals, for example, 23972340 + ... + 24032086.
It is an arithmetic number, because the mean of its divisors is an integer number (92436489288).
Almost surely, 21434060220111 is an apocalyptic number.
1434060220111 is a deficient number, since it is larger than the sum of its proper divisors (44923608497).
1434060220111 is a wasteful number, since it uses less digits than its factorization.
1434060220111 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 64182.
The product of its (nonzero) digits is 1152, while the sum is 25.
Adding to 1434060220111 its reverse (1110220604341), we get a palindrome (2544280824452).
The spelling of 1434060220111 in words is "one trillion, four hundred thirty-four billion, sixty million, two hundred twenty thousand, one hundred eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.075 sec. • engine limits •