Base | Representation |
---|---|
bin | 10100100001111011… |
… | …00110010010100010 |
3 | 1001110010211200100220 |
4 | 22100331212102202 |
5 | 140033113020224 |
6 | 5021411423510 |
7 | 540064315422 |
oct | 122075462242 |
9 | 31403750326 |
10 | 11022001314 |
11 | 47466a57a5 |
12 | 21772b4b96 |
13 | 106865b98c |
14 | 767b9a482 |
15 | 447988279 |
hex | 290f664a2 |
11022001314 has 8 divisors (see below), whose sum is σ = 22044002640. Its totient is φ = 3674000436.
The previous prime is 11022001313. The next prime is 11022001337. The reversal of 11022001314 is 41310022011.
It is a sphenic number, since it is the product of 3 distinct primes.
11022001314 is an admirable number.
It is a junction number, because it is equal to n+sod(n) for n = 11022001293 and 11022001302.
It is not an unprimeable number, because it can be changed into a prime (11022001313) by changing a digit.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 918500104 + ... + 918500115.
It is an arithmetic number, because the mean of its divisors is an integer number (2755500330).
Almost surely, 211022001314 is an apocalyptic number.
11022001314 is a primitive abundant number, since it is smaller than the sum of its proper divisors, none of which is abundant.
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
11022001314 is a wasteful number, since it uses less digits than its factorization.
11022001314 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1837000224.
The product of its (nonzero) digits is 48, while the sum is 15.
Adding to 11022001314 its reverse (41310022011), we get a palindrome (52332023325).
The spelling of 11022001314 in words is "eleven billion, twenty-two million, one thousand, three hundred fourteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.075 sec. • engine limits •