Base | Representation |
---|---|
bin | 10111101011001… |
… | …111000110111101 |
3 | 1000200102100202011 |
4 | 113223033012331 |
5 | 1303141210140 |
6 | 103225331221 |
7 | 12562141531 |
oct | 2753170675 |
9 | 1020370664 |
10 | 397210045 |
11 | 19423a871 |
12 | b1036b11 |
13 | 643a573b |
14 | 3aa79bc1 |
15 | 24d11cea |
hex | 17acf1bd |
397210045 has 4 divisors (see below), whose sum is σ = 476652060. Its totient is φ = 317768032.
The previous prime is 397210043. The next prime is 397210087. The reversal of 397210045 is 540012793.
It is a semiprime because it is the product of two primes.
It can be written as a sum of positive squares in 2 ways, for example, as 60047001 + 337163044 = 7749^2 + 18362^2 .
It is a cyclic number.
It is not a de Polignac number, because 397210045 - 21 = 397210043 is a prime.
It is a junction number, because it is equal to n+sod(n) for n = 397209989 and 397210016.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (397210043) 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 3 ways as a sum of consecutive naturals, for example, 39721000 + ... + 39721009.
It is an arithmetic number, because the mean of its divisors is an integer number (119163015).
Almost surely, 2397210045 is an apocalyptic number.
It is an amenable number.
397210045 is a deficient number, since it is larger than the sum of its proper divisors (79442015).
397210045 is an equidigital number, since it uses as much as digits as its factorization.
397210045 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 79442014.
The product of its (nonzero) digits is 7560, while the sum is 31.
The square root of 397210045 is about 19930.1290763507. The cubic root of 397210045 is about 735.0892544363.
The spelling of 397210045 in words is "three hundred ninety-seven million, two hundred ten thousand, forty-five".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.075 sec. • engine limits •