Base | Representation |
---|---|
bin | 110000110110001110000… |
… | …1100000010000101100001 |
3 | 212202210201211110110221212 |
4 | 1201230130030002011201 |
5 | 1334443230220044334 |
6 | 22140050433555505 |
7 | 1262014646150234 |
oct | 141543414020541 |
9 | 25683654413855 |
10 | 6713506799969 |
11 | 2159200627852 |
12 | 905157a15b95 |
13 | 399108b94968 |
14 | 192d14ca541b |
15 | b9978beeece |
hex | 61b1c302161 |
6713506799969 has 2 divisors, whose sum is σ = 6713506799970. Its totient is φ = 6713506799968.
The previous prime is 6713506799959. The next prime is 6713506800071. The reversal of 6713506799969 is 9699976053176.
It is a happy number.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 5918092540369 + 795414259600 = 2432713^2 + 891860^2 .
It is a cyclic number.
It is not a de Polignac number, because 6713506799969 - 24 = 6713506799953 is a prime.
It is a super-2 number, since 2×67135067999692 (a number of 26 digits) contains 22 as substring.
It is a self number, because there is not a number n which added to its sum of digits gives 6713506799969.
It is not a weakly prime, because it can be changed into another prime (6713506799959) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 3356753399984 + 3356753399985.
It is an arithmetic number, because the mean of its divisors is an integer number (3356753399985).
Almost surely, 26713506799969 is an apocalyptic number.
It is an amenable number.
6713506799969 is a deficient number, since it is larger than the sum of its proper divisors (1).
6713506799969 is an equidigital number, since it uses as much as digits as its factorization.
6713506799969 is an evil number, because the sum of its binary digits is even.
The product of its (nonzero) digits is 1041624360, while the sum is 77.
The spelling of 6713506799969 in words is "six trillion, seven hundred thirteen billion, five hundred six million, seven hundred ninety-nine thousand, nine hundred sixty-nine".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.075 sec. • engine limits •