Base | Representation |
---|---|
bin | 1010000110111000010100… |
… | …0100110011000101110001 |
3 | 1110100102101220002121220220 |
4 | 2201232011010303011301 |
5 | 2424040031113203241 |
6 | 35345215134523253 |
7 | 2224624154034066 |
oct | 241560504630561 |
9 | 43312356077826 |
10 | 11113313022321 |
11 | 35a51475287a4 |
12 | 12b5a02066529 |
13 | 627c9a1126a3 |
14 | 2a5c5c764c6d |
15 | 144139578166 |
hex | a1b85133171 |
11113313022321 has 32 divisors (see below), whose sum is σ = 14903746744320. Its totient is φ = 7366036641024.
The previous prime is 11113313022311. The next prime is 11113313022337. The reversal of 11113313022321 is 12322031331111.
It is not a de Polignac number, because 11113313022321 - 238 = 10838435115377 is a prime.
It is a junction number, because it is equal to n+sod(n) for n = 11113313022291 and 11113313022300.
It is not an unprimeable number, because it can be changed into a prime (11113313022311) by changing a digit.
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 31 ways as a sum of consecutive naturals, for example, 498858235 + ... + 498880511.
It is an arithmetic number, because the mean of its divisors is an integer number (465742085760).
Almost surely, 211113313022321 is an apocalyptic number.
It is an amenable number.
11113313022321 is a deficient number, since it is larger than the sum of its proper divisors (3790433721999).
11113313022321 is a wasteful number, since it uses less digits than its factorization.
11113313022321 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 24025.
The product of its (nonzero) digits is 648, while the sum is 24.
Adding to 11113313022321 its reverse (12322031331111), we get a palindrome (23435344353432).
The spelling of 11113313022321 in words is "eleven trillion, one hundred thirteen billion, three hundred thirteen million, twenty-two thousand, three hundred twenty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •