Base | Representation |
---|---|
bin | 1011100011000001100… |
… | …00101011100001000101 |
3 | 1101221002220121212101222 |
4 | 11301200300223201011 |
5 | 23000031123141000 |
6 | 502134051330125 |
7 | 40444043313245 |
oct | 5614060534105 |
9 | 1357086555358 |
10 | 396760365125 |
11 | 1432a0978803 |
12 | 64a8a2b0945 |
13 | 2b550403227 |
14 | 152bbc1bb25 |
15 | a4c22bba85 |
hex | 5c60c2b845 |
396760365125 has 36 divisors (see below), whose sum is σ = 505151006724. Its totient is φ = 311126493600.
The previous prime is 396760365007. The next prime is 396760365151. The reversal of 396760365125 is 521563067693.
It is a powerful number, because all its prime factors have an exponent greater than 1 and also an Achilles number because it is not a perfect power.
It can be written as a sum of positive squares in 6 ways, for example, as 53700646756 + 343059718369 = 231734^2 + 585713^2 .
It is not a de Polignac number, because 396760365125 - 226 = 396693256261 is a prime.
It is a Harshad number since it is a multiple of its sum of digits (53).
It is a Duffinian number.
It is a congruent number.
It is an unprimeable number.
It is a polite number, since it can be written in 35 ways as a sum of consecutive naturals, for example, 373245344 + ... + 373246406.
It is an arithmetic number, because the mean of its divisors is an integer number (14031972409).
Almost surely, 2396760365125 is an apocalyptic number.
It is an amenable number.
396760365125 is a deficient number, since it is larger than the sum of its proper divisors (108390641599).
396760365125 is an frugal number, since it uses more digits than its factorization.
396760365125 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 2247 (or 1121 counting only the distinct ones).
The product of its (nonzero) digits is 6123600, while the sum is 53.
The spelling of 396760365125 in words is "three hundred ninety-six billion, seven hundred sixty million, three hundred sixty-five thousand, one hundred twenty-five".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.065 sec. • engine limits •