Base | Representation |
---|---|
bin | 10100010101101100011… |
… | …110001000000111000111 |
3 | 11221121200000102101011102 |
4 | 110111230132020013013 |
5 | 140344424124124241 |
6 | 2550030503130315 |
7 | 202656626514044 |
oct | 24255436100707 |
9 | 4847600371142 |
10 | 1397684208071 |
11 | 499833330568 |
12 | 1a6a6974399b |
13 | a1a54bc2aa8 |
14 | 4b910c2a1cb |
15 | 26554bbe39b |
hex | 1456c7881c7 |
1397684208071 has 2 divisors, whose sum is σ = 1397684208072. Its totient is φ = 1397684208070.
The previous prime is 1397684208047. The next prime is 1397684208073. The reversal of 1397684208071 is 1708024867931.
It is a strong prime.
It is a cyclic number.
It is not a de Polignac number, because 1397684208071 - 234 = 1380504338887 is a prime.
It is a super-2 number, since 2×13976842080712 (a number of 25 digits) contains 22 as substring.
Together with 1397684208073, it forms a pair of twin primes.
It is a Chen prime.
It is a junction number, because it is equal to n+sod(n) for n = 1397684207998 and 1397684208016.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (1397684208073) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 698842104035 + 698842104036.
It is an arithmetic number, because the mean of its divisors is an integer number (698842104036).
Almost surely, 21397684208071 is an apocalyptic number.
1397684208071 is a deficient number, since it is larger than the sum of its proper divisors (1).
1397684208071 is an equidigital number, since it uses as much as digits as its factorization.
1397684208071 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 4064256, while the sum is 56.
The spelling of 1397684208071 in words is "one trillion, three hundred ninety-seven billion, six hundred eighty-four million, two hundred eight thousand, seventy-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •