Base | Representation |
---|---|
bin | 1010000010000010110001… |
… | …0110111010011011100010 |
3 | 1110001110221000022220220122 |
4 | 2200200230112322123202 |
5 | 2421204342334021010 |
6 | 35243114015440242 |
7 | 2215623065623346 |
oct | 240405426723342 |
9 | 43043830286818 |
10 | 11030220220130 |
11 | 3572987836651 |
12 | 12a1892526082 |
13 | 6201b7302b07 |
14 | 2a1c18d47626 |
15 | 141dc47d3855 |
hex | a082c5ba6e2 |
11030220220130 has 8 divisors (see below), whose sum is σ = 19854396396252. Its totient is φ = 4412088088048.
The previous prime is 11030220220127. The next prime is 11030220220141. The reversal of 11030220220130 is 3102202203011.
It can be written as a sum of positive squares in 2 ways, for example, as 10367749570201 + 662470649929 = 3219899^2 + 813923^2 .
It is a sphenic number, since it is the product of 3 distinct primes.
It is a Curzon number.
It is a junction number, because it is equal to n+sod(n) for n = 11030220220099 and 11030220220108.
It is an unprimeable number.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 551511010997 + ... + 551511011016.
Almost surely, 211030220220130 is an apocalyptic number.
11030220220130 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
11030220220130 is a deficient number, since it is larger than the sum of its proper divisors (8824176176122).
11030220220130 is a wasteful number, since it uses less digits than its factorization.
11030220220130 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1103022022020.
The product of its (nonzero) digits is 144, while the sum is 17.
Adding to 11030220220130 its reverse (3102202203011), we get a palindrome (14132422423141).
The spelling of 11030220220130 in words is "eleven trillion, thirty billion, two hundred twenty million, two hundred twenty thousand, one hundred thirty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •