Base | Representation |
---|---|
bin | 11101001011101000001… |
… | …10100110111011011101 |
3 | 10112212002011102012002201 |
4 | 32211310012212323131 |
5 | 112411434332104331 |
6 | 2044342254451501 |
7 | 132304141111054 |
oct | 16456406467335 |
9 | 3485064365081 |
10 | 1002675269341 |
11 | 357261060399 |
12 | 1423a9b03b91 |
13 | 73723603855 |
14 | 3675b87d39b |
15 | 1b136563a61 |
hex | e9741a6edd |
1002675269341 has 2 divisors, whose sum is σ = 1002675269342. Its totient is φ = 1002675269340.
The previous prime is 1002675269279. The next prime is 1002675269363. The reversal of 1002675269341 is 1439625762001.
It is a happy number.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 633582568441 + 369092700900 = 795979^2 + 607530^2 .
It is a cyclic number.
It is not a de Polignac number, because 1002675269341 - 225 = 1002641714909 is a prime.
It is a junction number, because it is equal to n+sod(n) for n = 1002675269291 and 1002675269300.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (1002675269441) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (23) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 501337634670 + 501337634671.
It is an arithmetic number, because the mean of its divisors is an integer number (501337634671).
Almost surely, 21002675269341 is an apocalyptic number.
It is an amenable number.
1002675269341 is a deficient number, since it is larger than the sum of its proper divisors (1).
1002675269341 is an equidigital number, since it uses as much as digits as its factorization.
1002675269341 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 544320, while the sum is 46.
The spelling of 1002675269341 in words is "one trillion, two billion, six hundred seventy-five million, two hundred sixty-nine thousand, three hundred forty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •