Base | Representation |
---|---|
bin | 111100011110100… |
… | …011101011000101 |
3 | 2121201020020002002 |
4 | 330132203223011 |
5 | 4034222042042 |
6 | 244403155045 |
7 | 34100220005 |
oct | 7436435305 |
9 | 2551206062 |
10 | 1014643397 |
11 | 480815669 |
12 | 243975a85 |
13 | 132296411 |
14 | 98a80005 |
15 | 5e125132 |
hex | 3c7a3ac5 |
1014643397 has 2 divisors, whose sum is σ = 1014643398. Its totient is φ = 1014643396.
The previous prime is 1014643381. The next prime is 1014643411. The reversal of 1014643397 is 7933464101.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 572214241 + 442429156 = 23921^2 + 21034^2 .
It is a cyclic number.
It is not a de Polignac number, because 1014643397 - 24 = 1014643381 is a prime.
It is a self number, because there is not a number n which added to its sum of digits gives 1014643397.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (1014643327) 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 as a sum of consecutive naturals, namely, 507321698 + 507321699.
It is an arithmetic number, because the mean of its divisors is an integer number (507321699).
Almost surely, 21014643397 is an apocalyptic number.
It is an amenable number.
1014643397 is a deficient number, since it is larger than the sum of its proper divisors (1).
1014643397 is an equidigital number, since it uses as much as digits as its factorization.
1014643397 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 54432, while the sum is 38.
The square root of 1014643397 is about 31853.4675820389. The cubic root of 1014643397 is about 1004.8574988337.
The spelling of 1014643397 in words is "one billion, fourteen million, six hundred forty-three thousand, three hundred ninety-seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.074 sec. • engine limits •