Base | Representation |
---|---|
bin | 1010000000011010000001… |
… | …1101111000011101010001 |
3 | 1102221210100111122010222212 |
4 | 2200012200131320131101 |
5 | 2420224301434324131 |
6 | 35222144015241505 |
7 | 2213606244106220 |
oct | 240064035703521 |
9 | 42853314563885 |
10 | 11002103433041 |
11 | 3561a69622326 |
12 | 1298346219295 |
13 | 61a6561446a6 |
14 | 2a070ca76cb7 |
15 | 1412cb19da2b |
hex | a01a0778751 |
11002103433041 has 8 divisors (see below), whose sum is σ = 12578084744640. Its totient is φ = 9427185183888.
The previous prime is 11002103433023. The next prime is 11002103433047. The reversal of 11002103433041 is 14033430120011.
It is a sphenic number, since it is the product of 3 distinct primes.
It is a cyclic number.
It is not a de Polignac number, because 11002103433041 - 210 = 11002103432017 is a prime.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 11002103432998 and 11002103433016.
It is not an unprimeable number, because it can be changed into a prime (11002103433047) by changing a digit.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 265743431 + ... + 265784828.
It is an arithmetic number, because the mean of its divisors is an integer number (1572260593080).
Almost surely, 211002103433041 is an apocalyptic number.
It is an amenable number.
11002103433041 is a deficient number, since it is larger than the sum of its proper divisors (1575981311599).
11002103433041 is an equidigital number, since it uses as much as digits as its factorization.
11002103433041 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 531531223.
The product of its (nonzero) digits is 864, while the sum is 23.
Adding to 11002103433041 its reverse (14033430120011), we get a palindrome (25035533553052).
The spelling of 11002103433041 in words is "eleven trillion, two billion, one hundred three million, four hundred thirty-three thousand, forty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •