Base | Representation |
---|---|
bin | 1010010010010110010001… |
… | …1001001000101010000110 |
3 | 1111001020221120022201001210 |
4 | 2210211210121020222012 |
5 | 2440302030244413110 |
6 | 40015521221032250 |
7 | 2245100412650343 |
oct | 244454431105206 |
9 | 44036846281053 |
10 | 11310333201030 |
11 | 367075a261076 |
12 | 1328027855686 |
13 | 640737c93ba6 |
14 | 2b15ccbb37ca |
15 | 14931b0e2520 |
hex | a4964648a86 |
11310333201030 has 32 divisors (see below), whose sum is σ = 27145078783200. Its totient is φ = 3016057842432.
The previous prime is 11310333201023. The next prime is 11310333201049. The reversal of 11310333201030 is 3010233301311.
It is a junction number, because it is equal to n+sod(n) for n = 11310333200988 and 11310333201006.
It is a congruent number.
It is an unprimeable number.
It is a pernicious number, because its binary representation contains a prime number (17) of ones.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 1106586 + ... + 4883154.
It is an arithmetic number, because the mean of its divisors is an integer number (848283711975).
Almost surely, 211310333201030 is an apocalyptic number.
11310333201030 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
11310333201030 is an abundant number, since it is smaller than the sum of its proper divisors (15834745582170).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
11310333201030 is a wasteful number, since it uses less digits than its factorization.
11310333201030 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 3876408.
The product of its (nonzero) digits is 486, while the sum is 21.
Adding to 11310333201030 its reverse (3010233301311), we get a palindrome (14320566502341).
The spelling of 11310333201030 in words is "eleven trillion, three hundred ten billion, three hundred thirty-three million, two hundred one thousand, thirty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •