Base | Representation |
---|---|
bin | 10111101010110… |
… | …010101000111011 |
3 | 1000200012102210021 |
4 | 113222302220323 |
5 | 1303123442220 |
6 | 103223031311 |
7 | 12561144544 |
oct | 2752625073 |
9 | 1020172707 |
10 | 397093435 |
11 | 1941701a2 |
12 | b0b9b537 |
13 | 6436463b |
14 | 3aa494cb |
15 | 24cdc4aa |
hex | 17ab2a3b |
397093435 has 16 divisors (see below), whose sum is σ = 492359616. Its totient is φ = 307214208.
The previous prime is 397093427. The next prime is 397093439. The reversal of 397093435 is 534390793.
It is a cyclic number.
It is not a de Polignac number, because 397093435 - 23 = 397093427 is a prime.
It is a super-2 number, since 2×3970934352 = 315366392240198450, which contains 22 as substring.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 397093391 and 397093400.
It is not an unprimeable number, because it can be changed into a prime (397093439) 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, 24469 + ... + 37321.
It is an arithmetic number, because the mean of its divisors is an integer number (30772476).
Almost surely, 2397093435 is an apocalyptic number.
397093435 is a deficient number, since it is larger than the sum of its proper divisors (95266181).
397093435 is a wasteful number, since it uses less digits than its factorization.
397093435 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 13062.
The product of its (nonzero) digits is 306180, while the sum is 43.
The square root of 397093435 is about 19927.2033913442. The cubic root of 397093435 is about 735.0173133658.
The spelling of 397093435 in words is "three hundred ninety-seven million, ninety-three thousand, four hundred thirty-five".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •