Base | Representation |
---|---|
bin | 10000000001011000110… |
… | …010101110101110110001 |
3 | 10220020212200020011110021 |
4 | 100001120302232232301 |
5 | 121014322314241033 |
6 | 2201443143203441 |
7 | 142354560550621 |
oct | 20013062565661 |
9 | 3806780204407 |
10 | 1101001321393 |
11 | 394a285a7636 |
12 | 15946b146581 |
13 | 7ca93388a3c |
14 | 3b40847a881 |
15 | 1d98d843b2d |
hex | 10058caebb1 |
1101001321393 has 2 divisors, whose sum is σ = 1101001321394. Its totient is φ = 1101001321392.
The previous prime is 1101001321331. The next prime is 1101001321397. The reversal of 1101001321393 is 3931231001011.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 1075167831409 + 25833489984 = 1036903^2 + 160728^2 .
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-1101001321393 is a prime.
It is not a weakly prime, because it can be changed into another prime (1101001321397) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 550500660696 + 550500660697.
It is an arithmetic number, because the mean of its divisors is an integer number (550500660697).
Almost surely, 21101001321393 is an apocalyptic number.
It is an amenable number.
1101001321393 is a deficient number, since it is larger than the sum of its proper divisors (1).
1101001321393 is an equidigital number, since it uses as much as digits as its factorization.
1101001321393 is an evil number, because the sum of its binary digits is even.
The product of its (nonzero) digits is 486, while the sum is 25.
The spelling of 1101001321393 in words is "one trillion, one hundred one billion, one million, three hundred twenty-one thousand, three hundred ninety-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •