Base | Representation |
---|---|
bin | 1010000010000011000111… |
… | …1000111011001100010110 |
3 | 1110001111011110221202110110 |
4 | 2200200301320323030112 |
5 | 2421210040113202410 |
6 | 35243131132503450 |
7 | 2215625303466405 |
oct | 240406170731426 |
9 | 43044143852413 |
10 | 11030313022230 |
11 | 3572a251611a7 |
12 | 12a18b961ab86 |
13 | 6202005c62b8 |
14 | 2a1c273c363c |
15 | 141dcca15720 |
hex | a0831e3b316 |
11030313022230 has 32 divisors (see below), whose sum is σ = 26477459599104. Its totient is φ = 2940893656416.
The previous prime is 11030313022229. The next prime is 11030313022247. The reversal of 11030313022230 is 3222031303011.
It is a junction number, because it is equal to n+sod(n) for n = 11030313022197 and 11030313022206.
It is a congruent number.
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 15 ways as a sum of consecutive naturals, for example, 32525344 + ... + 32862723.
It is an arithmetic number, because the mean of its divisors is an integer number (827420612472).
Almost surely, 211030313022230 is an apocalyptic number.
11030313022230 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
11030313022230 is an abundant number, since it is smaller than the sum of its proper divisors (15447146576874).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
11030313022230 is a wasteful number, since it uses less digits than its factorization.
11030313022230 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 65393700.
The product of its (nonzero) digits is 648, while the sum is 21.
Adding to 11030313022230 its reverse (3222031303011), we get a palindrome (14252344325241).
The spelling of 11030313022230 in words is "eleven trillion, thirty billion, three hundred thirteen million, twenty-two thousand, two hundred thirty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •