Base | Representation |
---|---|
bin | 101010010101111… |
… | …0011101000000101 |
3 | 10200000102120202121 |
4 | 1110223303220011 |
5 | 10402204113142 |
6 | 352552005541 |
7 | 50131225666 |
oct | 12453635005 |
9 | 3600376677 |
10 | 1420769797 |
11 | 669a95417 |
12 | 3379908b1 |
13 | 1984713b5 |
14 | d699b36d |
15 | 84ae8c67 |
hex | 54af3a05 |
1420769797 has 4 divisors (see below), whose sum is σ = 1420848000. Its totient is φ = 1420691596.
The previous prime is 1420769717. The next prime is 1420769809. The reversal of 1420769797 is 7979670241.
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, and also a brilliant number, because the two primes have the same length, and also an emirpimes, since its reverse is a distinct semiprime: 7979670241 = 893292.
It is a cyclic number.
It is not a de Polignac number, because 1420769797 - 211 = 1420767749 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 (1420769717) 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, 3954 + ... + 53452.
It is an arithmetic number, because the mean of its divisors is an integer number (355212000).
Almost surely, 21420769797 is an apocalyptic number.
It is an amenable number.
1420769797 is a deficient number, since it is larger than the sum of its proper divisors (78203).
1420769797 is an equidigital number, since it uses as much as digits as its factorization.
1420769797 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 78202.
The product of its (nonzero) digits is 1333584, while the sum is 52.
The square root of 1420769797 is about 37693.1001245586. The cubic root of 1420769797 is about 1124.1939370297.
The spelling of 1420769797 in words is "one billion, four hundred twenty million, seven hundred sixty-nine thousand, seven hundred ninety-seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.080 sec. • engine limits •