Base | Representation |
---|---|
bin | 101101000111100110001000… |
… | …0000001011100111111000101 |
3 | 1221001012020000110211200120112 |
4 | 1122033030100001130333011 |
5 | 404004241413224243423 |
6 | 3524022411451442405 |
7 | 146410530164021546 |
oct | 13217142001347705 |
9 | 1831166013750515 |
10 | 396868131868613 |
11 | 1054aa914122059 |
12 | 38617852456405 |
13 | 1405a672ac0152 |
14 | 700073d1164cd |
15 | 30d36b6a60a78 |
hex | 168f31005cfc5 |
396868131868613 has 2 divisors, whose sum is σ = 396868131868614. Its totient is φ = 396868131868612.
The previous prime is 396868131868589. The next prime is 396868131868633. The reversal of 396868131868613 is 316868131868693.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 330372865050244 + 66495266818369 = 18176162^2 + 8154463^2 .
It is a cyclic number.
It is not a de Polignac number, because 396868131868613 - 224 = 396868115091397 is a prime.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (396868131868633) 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, 198434065934306 + 198434065934307.
It is an arithmetic number, because the mean of its divisors is an integer number (198434065934307).
Almost surely, 2396868131868613 is an apocalyptic number.
It is an amenable number.
396868131868613 is a deficient number, since it is larger than the sum of its proper divisors (1).
396868131868613 is an equidigital number, since it uses as much as digits as its factorization.
396868131868613 is an odious number, because the sum of its binary digits is odd.
The product of its digits is 1289945088, while the sum is 77.
The spelling of 396868131868613 in words is "three hundred ninety-six trillion, eight hundred sixty-eight billion, one hundred thirty-one million, eight hundred sixty-eight thousand, six hundred thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.074 sec. • engine limits •