Base | Representation |
---|---|
bin | 100110010111… |
… | …0111111000101 |
3 | 1101211222010201 |
4 | 1030232333011 |
5 | 20122143042 |
6 | 1555050501 |
7 | 332656321 |
oct | 114567705 |
9 | 41758121 |
10 | 20115397 |
11 | 10399aa5 |
12 | 68a0a31 |
13 | 4223b03 |
14 | 2958981 |
15 | 1b751b7 |
hex | 132efc5 |
20115397 has 2 divisors, whose sum is σ = 20115398. Its totient is φ = 20115396.
The previous prime is 20115371. The next prime is 20115413. The reversal of 20115397 is 79351102.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 19633761 + 481636 = 4431^2 + 694^2 .
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-20115397 is a prime.
It is a Chen prime.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (20115307) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 10057698 + 10057699.
It is an arithmetic number, because the mean of its divisors is an integer number (10057699).
Almost surely, 220115397 is an apocalyptic number.
It is an amenable number.
20115397 is a deficient number, since it is larger than the sum of its proper divisors (1).
20115397 is an equidigital number, since it uses as much as digits as its factorization.
20115397 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 1890, while the sum is 28.
The square root of 20115397 is about 4485.0191749869. The cubic root of 20115397 is about 271.9628202137.
Adding to 20115397 its reverse (79351102), we get a palindrome (99466499).
The spelling of 20115397 in words is "twenty million, one hundred fifteen thousand, three hundred ninety-seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •