Base | Representation |
---|---|
bin | 110001000111110110010… |
… | …0010001101011111100101 |
3 | 212220102110000201120001202 |
4 | 1202033230202031133211 |
5 | 1341103242133410112 |
6 | 22205311034332245 |
7 | 1264525021151246 |
oct | 142175442153745 |
9 | 25812400646052 |
10 | 6751362013157 |
11 | 2173266937803 |
12 | 91056158a085 |
13 | 39c85c7a7aa8 |
14 | 194aa6688ccd |
15 | ba9422746c2 |
hex | 623ec88d7e5 |
6751362013157 has 2 divisors, whose sum is σ = 6751362013158. Its totient is φ = 6751362013156.
The previous prime is 6751362013153. The next prime is 6751362013217. The reversal of 6751362013157 is 7513102631576.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 6470964228481 + 280397784676 = 2543809^2 + 529526^2 .
It is a cyclic number.
It is not a de Polignac number, because 6751362013157 - 22 = 6751362013153 is a prime.
It is a super-2 number, since 2×67513620131572 (a number of 26 digits) contains 22 as substring.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (6751362013153) 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, 3375681006578 + 3375681006579.
It is an arithmetic number, because the mean of its divisors is an integer number (3375681006579).
Almost surely, 26751362013157 is an apocalyptic number.
It is an amenable number.
6751362013157 is a deficient number, since it is larger than the sum of its proper divisors (1).
6751362013157 is an equidigital number, since it uses as much as digits as its factorization.
6751362013157 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 793800, while the sum is 47.
The spelling of 6751362013157 in words is "six trillion, seven hundred fifty-one billion, three hundred sixty-two million, thirteen thousand, one hundred fifty-seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •