Base | Representation |
---|---|
bin | 10111101000011… |
… | …110000001010101 |
3 | 1000122001111202021 |
4 | 113220132001111 |
5 | 1303000002233 |
6 | 103202013141 |
7 | 12553031023 |
oct | 2750360125 |
9 | 1018044667 |
10 | 396484693 |
11 | 193894900 |
12 | b09471b1 |
13 | 641b0537 |
14 | 3a92b713 |
15 | 24c1be2d |
hex | 17a1e055 |
396484693 has 12 divisors (see below), whose sum is σ = 461443500. Its totient is φ = 339236480.
The previous prime is 396484643. The next prime is 396484703.
396484693 is nontrivially palindromic in base 10.
It can be written as a sum of positive squares in 2 ways, for example, as 266113969 + 130370724 = 16313^2 + 11418^2 .
It is not a de Polignac number, because 396484693 - 29 = 396484181 is a prime.
It is a super-2 number, since 2×3964846932 = 314400223566608498, which contains 22 as substring.
It is a Duffinian number.
It is a self number, because there is not a number n which added to its sum of digits gives 396484693.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (396484633) by changing a digit.
It is a polite number, since it can be written in 11 ways as a sum of consecutive naturals, for example, 94318 + ... + 98431.
It is an arithmetic number, because the mean of its divisors is an integer number (38453625).
Almost surely, 2396484693 is an apocalyptic number.
It is an amenable number.
396484693 is a deficient number, since it is larger than the sum of its proper divisors (64958807).
396484693 is a wasteful number, since it uses less digits than its factorization.
396484693 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 192788 (or 192777 counting only the distinct ones).
The product of its digits is 3359232, while the sum is 52.
The square root of 396484693 is about 19911.9233877594. The cubic root of 396484693 is about 734.6415288075.
The spelling of 396484693 in words is "three hundred ninety-six million, four hundred eighty-four thousand, six hundred ninety-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.176 sec. • engine limits •