Base | Representation |
---|---|
bin | 1011100010001001111… |
… | …10010010101011100001 |
3 | 1101212220102101202210021 |
4 | 11301010332102223201 |
5 | 22443102301440421 |
6 | 502015515233441 |
7 | 40426352606614 |
oct | 5610476225341 |
9 | 1355812352707 |
10 | 396294171361 |
11 | 143081801500 |
12 | 6497a148881 |
13 | 2b4a795672a |
14 | 15275d4617b |
15 | a4963d0341 |
hex | 5c44f92ae1 |
396294171361 has 27 divisors (see below), whose sum is σ = 439659963729. Its totient is φ = 356937273000.
The previous prime is 396294171341. The next prime is 396294171437. The reversal of 396294171361 is 163171492693.
The square root of 396294171361 is 629519.
It is a perfect power (a square), and thus also a powerful number.
It is not a de Polignac number, because 396294171361 - 29 = 396294170849 is a prime.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 396294171299 and 396294171308.
It is not an unprimeable number, because it can be changed into a prime (396294171341) 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 in 26 ways as a sum of consecutive naturals, for example, 1045630870 + ... + 1045631248.
Almost surely, 2396294171361 is an apocalyptic number.
396294171361 is the 629519-th square number.
396294171361 is the 314760-th centered octagonal number.
It is an amenable number.
396294171361 is a deficient number, since it is larger than the sum of its proper divisors (43365792368).
396294171361 is an frugal number, since it uses more digits than its factorization.
396294171361 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1082 (or 541 counting only the distinct ones).
The product of its digits is 1469664, while the sum is 52.
The spelling of 396294171361 in words is "three hundred ninety-six billion, two hundred ninety-four million, one hundred seventy-one thousand, three hundred sixty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.074 sec. • engine limits •