Base | Representation |
---|---|
bin | 10000001011110001000… |
… | …000100000001110000101 |
3 | 10221022122022000212100101 |
4 | 100023301000200032011 |
5 | 121210133110102042 |
6 | 2210525023044101 |
7 | 143230663360501 |
oct | 20136100401605 |
9 | 3838568025311 |
10 | 1112145003397 |
11 | 39972695188a |
12 | 15b65b140631 |
13 | 80b4acac60c |
14 | 3bb8446d301 |
15 | 1dde1d156b7 |
hex | 102f1020385 |
1112145003397 has 2 divisors, whose sum is σ = 1112145003398. Its totient is φ = 1112145003396.
The previous prime is 1112145003373. The next prime is 1112145003407. The reversal of 1112145003397 is 7933005412111.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 1050735702916 + 61409300481 = 1025054^2 + 247809^2 .
It is a cyclic number.
It is not a de Polignac number, because 1112145003397 - 27 = 1112145003269 is a prime.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (1112145043397) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (13) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 556072501698 + 556072501699.
It is an arithmetic number, because the mean of its divisors is an integer number (556072501699).
Almost surely, 21112145003397 is an apocalyptic number.
It is an amenable number.
1112145003397 is a deficient number, since it is larger than the sum of its proper divisors (1).
1112145003397 is an equidigital number, since it uses as much as digits as its factorization.
1112145003397 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 22680, while the sum is 37.
The spelling of 1112145003397 in words is "one trillion, one hundred twelve billion, one hundred forty-five million, three thousand, three hundred ninety-seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.080 sec. • engine limits •