Base | Representation |
---|---|
bin | 1000101101000000000101011… |
… | …1010011100001001011111001 |
3 | 2222022102200102202202000112102 |
4 | 2023100001113103201023321 |
5 | 1120233020443444440224 |
6 | 10010310111254153145 |
7 | 242666365323064535 |
oct | 21320012723411371 |
9 | 2868380382660472 |
10 | 612429441405689 |
11 | 16815895a741a86 |
12 | 58830b189527b5 |
13 | 20395b0527064b |
14 | ab33a591acbc5 |
15 | 4ac0a665714ae |
hex | 22d00574e12f9 |
612429441405689 has 2 divisors, whose sum is σ = 612429441405690. Its totient is φ = 612429441405688.
The previous prime is 612429441405611. The next prime is 612429441405701. The reversal of 612429441405689 is 986504144924216.
It is a happy number.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 460570228810000 + 151859212595689 = 21460900^2 + 12323117^2 .
It is a cyclic number.
It is not a de Polignac number, because 612429441405689 - 212 = 612429441401593 is a prime.
It is a super-2 number, since 2×6124294414056892 (a number of 30 digits) contains 22 as substring.
It is not a weakly prime, because it can be changed into another prime (612429441485689) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 306214720702844 + 306214720702845.
It is an arithmetic number, because the mean of its divisors is an integer number (306214720702845).
Almost surely, 2612429441405689 is an apocalyptic number.
It is an amenable number.
612429441405689 is a deficient number, since it is larger than the sum of its proper divisors (1).
612429441405689 is an equidigital number, since it uses as much as digits as its factorization.
612429441405689 is an evil number, because the sum of its binary digits is even.
The product of its (nonzero) digits is 119439360, while the sum is 65.
The spelling of 612429441405689 in words is "six hundred twelve trillion, four hundred twenty-nine billion, four hundred forty-one million, four hundred five thousand, six hundred eighty-nine".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.078 sec. • engine limits •