Base | Representation |
---|---|
bin | 10100111000000101011… |
… | …110101101100110101101 |
3 | 12002010222111201111000112 |
4 | 110320011132231212231 |
5 | 142001040404422221 |
6 | 3015015020505405 |
7 | 205434666263411 |
oct | 24700536554655 |
9 | 5063874644015 |
10 | 1434611014061 |
11 | 503462576445 |
12 | 1b20543ab265 |
13 | a538b374554 |
14 | 4d6151bad41 |
15 | 274b69a515b |
hex | 14e057ad9ad |
1434611014061 has 2 divisors, whose sum is σ = 1434611014062. Its totient is φ = 1434611014060.
The previous prime is 1434611014021. The next prime is 1434611014079. The reversal of 1434611014061 is 1604101164341.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 1123017075625 + 311593938436 = 1059725^2 + 558206^2 .
It is a cyclic number.
It is not a de Polignac number, because 1434611014061 - 210 = 1434611013037 is a prime.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (1434611014021) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 717305507030 + 717305507031.
It is an arithmetic number, because the mean of its divisors is an integer number (717305507031).
Almost surely, 21434611014061 is an apocalyptic number.
It is an amenable number.
1434611014061 is a deficient number, since it is larger than the sum of its proper divisors (1).
1434611014061 is an equidigital number, since it uses as much as digits as its factorization.
1434611014061 is an evil number, because the sum of its binary digits is even.
The product of its (nonzero) digits is 6912, while the sum is 32.
The spelling of 1434611014061 in words is "one trillion, four hundred thirty-four billion, six hundred eleven million, fourteen thousand, sixty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.086 sec. • engine limits •