Base | Representation |
---|---|
bin | 1100011011111100100… |
… | …00101101101101101101 |
3 | 1111211222200002212201221 |
4 | 12031332100231231231 |
5 | 24000122414314234 |
6 | 524150320103341 |
7 | 42605250455551 |
oct | 6157620555555 |
9 | 1454880085657 |
10 | 427320073069 |
11 | 15525304a68a |
12 | 6a998764b51 |
13 | 313b0727456 |
14 | 1697a721861 |
15 | b1b0104eb4 |
hex | 637e42db6d |
427320073069 has 2 divisors, whose sum is σ = 427320073070. Its totient is φ = 427320073068.
The previous prime is 427320073067. The next prime is 427320073091. The reversal of 427320073069 is 960370023724.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 351234022500 + 76086050569 = 592650^2 + 275837^2 .
It is a cyclic number.
It is not a de Polignac number, because 427320073069 - 21 = 427320073067 is a prime.
It is a super-2 number, since 2×4273200730692 (a number of 24 digits) contains 22 as substring.
Together with 427320073067, it forms a pair of twin primes.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (427320073067) 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 as a sum of consecutive naturals, namely, 213660036534 + 213660036535.
It is an arithmetic number, because the mean of its divisors is an integer number (213660036535).
Almost surely, 2427320073069 is an apocalyptic number.
It is an amenable number.
427320073069 is a deficient number, since it is larger than the sum of its proper divisors (1).
427320073069 is an equidigital number, since it uses as much as digits as its factorization.
427320073069 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 381024, while the sum is 43.
The spelling of 427320073069 in words is "four hundred twenty-seven billion, three hundred twenty million, seventy-three thousand, sixty-nine".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.081 sec. • engine limits •