Base | Representation |
---|---|
bin | 1011100011100101000… |
… | …01100010010010100101 |
3 | 1101221212200101211220101 |
4 | 11301302201202102211 |
5 | 23001133421310221 |
6 | 502223415104101 |
7 | 40454322405112 |
oct | 5616241422245 |
9 | 1357780354811 |
10 | 397058385061 |
11 | 14343411a578 |
12 | 64b52072031 |
13 | 2b59a0899a0 |
14 | 15309637909 |
15 | a4dd538d91 |
hex | 5c728624a5 |
397058385061 has 16 divisors (see below), whose sum is σ = 432070503424. Its totient is φ = 362685786624.
The previous prime is 397058385043. The next prime is 397058385067. The reversal of 397058385061 is 160583850793.
It is a cyclic number.
It is not a de Polignac number, because 397058385061 - 235 = 362698646693 is a prime.
It is a super-2 number, since 2×3970583850612 (a number of 24 digits) contains 22 as substring.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 397058384993 and 397058385011.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (397058385067) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (17) of ones.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 11158480 + ... + 11194006.
It is an arithmetic number, because the mean of its divisors is an integer number (27004406464).
Almost surely, 2397058385061 is an apocalyptic number.
It is an amenable number.
397058385061 is a deficient number, since it is larger than the sum of its proper divisors (35012118363).
397058385061 is a wasteful number, since it uses less digits than its factorization.
397058385061 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 44500.
The product of its (nonzero) digits is 5443200, while the sum is 55.
The spelling of 397058385061 in words is "three hundred ninety-seven billion, fifty-eight million, three hundred eighty-five thousand, sixty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.064 sec. • engine limits •