Base | Representation |
---|---|
bin | 1010000001011101000101… |
… | …0010010100111010100001 |
3 | 1110000111210212210012110212 |
4 | 2200113101102110322201 |
5 | 2421023132200403031 |
6 | 35234322022503505 |
7 | 2215114260326150 |
oct | 240272122247241 |
9 | 43014725705425 |
10 | 11020102356641 |
11 | 3569665539aa4 |
12 | 129b929b94b95 |
13 | 61c264089041 |
14 | 2a15392a3597 |
15 | 1419d13e312b |
hex | a05d1494ea1 |
11020102356641 has 8 divisors (see below), whose sum is σ = 12594824841024. Its totient is φ = 9445485409200.
The previous prime is 11020102356589. The next prime is 11020102356677. The reversal of 11020102356641 is 14665320102011.
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 11020102356641 - 218 = 11020102094497 is a prime.
It is a Duffinian number.
It is a Curzon number.
It is a junction number, because it is equal to n+sod(n) for n = 11020102356598 and 11020102356607.
It is not an unprimeable number, because it can be changed into a prime (11020102352641) 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, 26160350 + ... + 26578263.
It is an arithmetic number, because the mean of its divisors is an integer number (1574353105128).
Almost surely, 211020102356641 is an apocalyptic number.
It is an amenable number.
11020102356641 is a deficient number, since it is larger than the sum of its proper divisors (1574722484383).
11020102356641 is an equidigital number, since it uses as much as digits as its factorization.
11020102356641 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 52768471.
The product of its (nonzero) digits is 8640, while the sum is 32.
Adding to 11020102356641 its reverse (14665320102011), we get a palindrome (25685422458652).
The spelling of 11020102356641 in words is "eleven trillion, twenty billion, one hundred two million, three hundred fifty-six thousand, six hundred forty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •