Base | Representation |
---|---|
bin | 1010000000111111010110… |
… | …1001101111100010111111 |
3 | 1102222202012202100112020122 |
4 | 2200033311221233202333 |
5 | 2420410311332241343 |
6 | 35230522123405155 |
7 | 2214412443111230 |
oct | 240176551574277 |
9 | 42882182315218 |
10 | 11012122540223 |
11 | 35662400a78a2 |
12 | 129a2816837bb |
13 | 61b591a91a8c |
14 | 2a0dbd571087 |
15 | 1416b5a83068 |
hex | a03f5a6f8bf |
11012122540223 has 8 divisors (see below), whose sum is σ = 12589357153440. Its totient is φ = 9435906489600.
The previous prime is 11012122540147. The next prime is 11012122540231. The reversal of 11012122540223 is 32204522121011.
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 11012122540223 - 228 = 11011854104767 is a prime.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 11012122540192 and 11012122540201.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (11012122540823) 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, 254617478 + ... + 254660723.
It is an arithmetic number, because the mean of its divisors is an integer number (1573669644180).
Almost surely, 211012122540223 is an apocalyptic number.
11012122540223 is a deficient number, since it is larger than the sum of its proper divisors (1577234613217).
11012122540223 is an equidigital number, since it uses as much as digits as its factorization.
11012122540223 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 509281297.
The product of its (nonzero) digits is 1920, while the sum is 26.
Adding to 11012122540223 its reverse (32204522121011), we get a palindrome (43216644661234).
The spelling of 11012122540223 in words is "eleven trillion, twelve billion, one hundred twenty-two million, five hundred forty thousand, two hundred twenty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.089 sec. • engine limits •