Base | Representation |
---|---|
bin | 1010000001101000111111… |
… | …1001100100000010000101 |
3 | 1110000211001202022020012011 |
4 | 2200122033321210002011 |
5 | 2421101204340010341 |
6 | 35240011222054221 |
7 | 2215256441445550 |
oct | 240321771440205 |
9 | 43024052266164 |
10 | 11023300313221 |
11 | 356aa56717119 |
12 | 12a0480b7a371 |
13 | 61c653790741 |
14 | 2a175dcb9697 |
15 | 141b1c03ab81 |
hex | a068fe64085 |
11023300313221 has 8 divisors (see below), whose sum is σ = 12598204388544. Its totient is φ = 9448432959840.
The previous prime is 11023300313189. The next prime is 11023300313293. The reversal of 11023300313221 is 12231300332011.
It is a sphenic number, since it is the product of 3 distinct primes.
It is not a de Polignac number, because 11023300313221 - 25 = 11023300313189 is a prime.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 11023300313192 and 11023300313201.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (11023300316221) by changing a digit.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 8534200 + ... + 9740593.
It is an arithmetic number, because the mean of its divisors is an integer number (1574775548568).
Almost surely, 211023300313221 is an apocalyptic number.
It is an amenable number.
11023300313221 is a deficient number, since it is larger than the sum of its proper divisors (1574904075323).
11023300313221 is an equidigital number, since it uses as much as digits as its factorization.
11023300313221 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 18360971.
The product of its (nonzero) digits is 648, while the sum is 22.
Adding to 11023300313221 its reverse (12231300332011), we get a palindrome (23254600645232).
The spelling of 11023300313221 in words is "eleven trillion, twenty-three billion, three hundred million, three hundred thirteen thousand, two hundred twenty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •