Base | Representation |
---|---|
bin | 1010010010111110000000… |
… | …1011101111101000010110 |
3 | 1111002021110221210020110010 |
4 | 2210233200023233220112 |
5 | 2440440402000000042 |
6 | 40024443503341050 |
7 | 2245625635153566 |
oct | 244574013575026 |
9 | 44067427706403 |
10 | 11321000000022 |
11 | 36752333a9029 |
12 | 132a103bb1786 |
13 | 641747b6777b |
14 | 2b1d2170ada6 |
15 | 1497427b559c |
hex | a4be02efa16 |
11321000000022 has 32 divisors (see below), whose sum is σ = 23146001049600. Its totient is φ = 3689821050048.
The previous prime is 11321000000021. The next prime is 11321000000029. The reversal of 11321000000022 is 22000000012311.
11321000000022 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is a junction number, because it is equal to n+sod(n) for n = 11320999999944 and 11321000000007.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (11321000000021) by changing a digit.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 19026247 + ... + 19612242.
It is an arithmetic number, because the mean of its divisors is an integer number (723312532800).
Almost surely, 211321000000022 is an apocalyptic number.
11321000000022 is an abundant number, since it is smaller than the sum of its proper divisors (11825001049578).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
11321000000022 is a wasteful number, since it uses less digits than its factorization.
11321000000022 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 38639580.
The product of its (nonzero) digits is 24, while the sum is 12.
Adding to 11321000000022 its reverse (22000000012311), we get a palindrome (33321000012333).
The spelling of 11321000000022 in words is "eleven trillion, three hundred twenty-one billion, twenty-two", and thus it is an aban number.
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •