Base | Representation |
---|---|
bin | 1010000010000010011001… |
… | …1001110111111111111110 |
3 | 1110001110200001101010221210 |
4 | 2200200212121313333332 |
5 | 2421204141301131220 |
6 | 35243100050505250 |
7 | 2215620443612211 |
oct | 240404631677776 |
9 | 43043601333853 |
10 | 11030120333310 |
11 | 3572936412161 |
12 | 12a1864b95226 |
13 | 62019c6cb9a0 |
14 | 2a1c09985778 |
15 | 141dbab526e0 |
hex | a0826677ffe |
11030120333310 has 64 divisors (see below), whose sum is σ = 28991815695360. Its totient is φ = 2669087783040.
The previous prime is 11030120333291. The next prime is 11030120333317. The reversal of 11030120333310 is 1333302103011.
It is a super-2 number, since 2×110301203333102 (a number of 27 digits) contains 22 as substring.
It is a Curzon number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (11030120333317) by changing a digit.
It is a polite number, since it can be written in 31 ways as a sum of consecutive naturals, for example, 239658006 + ... + 239704025.
It is an arithmetic number, because the mean of its divisors is an integer number (452997120240).
Almost surely, 211030120333310 is an apocalyptic number.
11030120333310 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
11030120333310 is an abundant number, since it is smaller than the sum of its proper divisors (17961695362050).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
11030120333310 is a wasteful number, since it uses less digits than its factorization.
11030120333310 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 479362113.
The product of its (nonzero) digits is 486, while the sum is 21.
Adding to 11030120333310 its reverse (1333302103011), we get a palindrome (12363422436321).
The spelling of 11030120333310 in words is "eleven trillion, thirty billion, one hundred twenty million, three hundred thirty-three thousand, three hundred ten".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.066 sec. • engine limits •