Base | Representation |
---|---|
bin | 1010001111001100… |
… | …1110100111000101 |
3 | 21002112001201121202 |
4 | 2203303032213011 |
5 | 21112004143042 |
6 | 1132405352245 |
7 | 125046411146 |
oct | 24363164705 |
9 | 7075051552 |
10 | 2748115397 |
11 | 119026a855 |
12 | 648408685 |
13 | 34a4620b1 |
14 | 1c0d99acd |
15 | 1113db632 |
hex | a3cce9c5 |
2748115397 has 2 divisors, whose sum is σ = 2748115398. Its totient is φ = 2748115396.
The previous prime is 2748115379. The next prime is 2748115459. The reversal of 2748115397 is 7935118472.
Together with previous prime (2748115379) it forms an Ormiston pair, because they use the same digits, order apart.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 2208436036 + 539679361 = 46994^2 + 23231^2 .
It is a cyclic number.
It is not a de Polignac number, because 2748115397 - 216 = 2748049861 is a prime.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (2748115367) 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, 1374057698 + 1374057699.
It is an arithmetic number, because the mean of its divisors is an integer number (1374057699).
Almost surely, 22748115397 is an apocalyptic number.
It is an amenable number.
2748115397 is a deficient number, since it is larger than the sum of its proper divisors (1).
2748115397 is an equidigital number, since it uses as much as digits as its factorization.
2748115397 is an odious number, because the sum of its binary digits is odd.
The product of its digits is 423360, while the sum is 47.
The square root of 2748115397 is about 52422.4703443094. The cubic root of 2748115397 is about 1400.6995478428.
The spelling of 2748115397 in words is "two billion, seven hundred forty-eight million, one hundred fifteen thousand, three hundred ninety-seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •