Base | Representation |
---|---|
bin | 101101000111100110001000… |
… | …0000000111101000000010101 |
3 | 1221001012020000110121000212222 |
4 | 1122033030100000331000111 |
5 | 404004241413211100441 |
6 | 3524022411444552125 |
7 | 146410530162634625 |
oct | 13217142000750025 |
9 | 1831166013530788 |
10 | 396868131737621 |
11 | 1054aa9140426a5 |
12 | 386178523b2645 |
13 | 1405a672a7563b |
14 | 700073d0c0885 |
15 | 30d36b6a36d4b |
hex | 168f31003d015 |
396868131737621 has 2 divisors, whose sum is σ = 396868131737622. Its totient is φ = 396868131737620.
The previous prime is 396868131737611. The next prime is 396868131737653. The reversal of 396868131737621 is 126737131868693.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 392729897647396 + 4138234090225 = 19817414^2 + 2034265^2 .
It is a cyclic number.
It is not a de Polignac number, because 396868131737621 - 210 = 396868131736597 is a prime.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (396868131737611) 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, 198434065868810 + 198434065868811.
It is an arithmetic number, because the mean of its divisors is an integer number (198434065868811).
Almost surely, 2396868131737621 is an apocalyptic number.
It is an amenable number.
396868131737621 is a deficient number, since it is larger than the sum of its proper divisors (1).
396868131737621 is an equidigital number, since it uses as much as digits as its factorization.
396868131737621 is an odious number, because the sum of its binary digits is odd.
The product of its digits is 329204736, while the sum is 71.
The spelling of 396868131737621 in words is "three hundred ninety-six trillion, eight hundred sixty-eight billion, one hundred thirty-one million, seven hundred thirty-seven thousand, six hundred twenty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.083 sec. • engine limits •