Base | Representation |
---|---|
bin | 101001110001101… |
… | …0001110101000101 |
3 | 10121200122122002211 |
4 | 1103203101311011 |
5 | 10332322210442 |
6 | 351032303421 |
7 | 46510511044 |
oct | 12343216505 |
9 | 3550578084 |
10 | 1401756997 |
11 | 65a289863 |
12 | 331541b71 |
13 | 194545414 |
14 | d424c55b |
15 | 830e0617 |
hex | 538d1d45 |
1401756997 has 2 divisors, whose sum is σ = 1401756998. Its totient is φ = 1401756996.
The previous prime is 1401756959. The next prime is 1401757013. The reversal of 1401756997 is 7996571041.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 1367076676 + 34680321 = 36974^2 + 5889^2 .
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-1401756997 is a prime.
It is a self number, because there is not a number n which added to its sum of digits gives 1401756997.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (1401756197) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 700878498 + 700878499.
It is an arithmetic number, because the mean of its divisors is an integer number (700878499).
Almost surely, 21401756997 is an apocalyptic number.
It is an amenable number.
1401756997 is a deficient number, since it is larger than the sum of its proper divisors (1).
1401756997 is an equidigital number, since it uses as much as digits as its factorization.
1401756997 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 476280, while the sum is 49.
The square root of 1401756997 is about 37440.0453658913. The cubic root of 1401756997 is about 1119.1567305198.
The spelling of 1401756997 in words is "one billion, four hundred one million, seven hundred fifty-six thousand, nine hundred ninety-seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.063 sec. • engine limits •