Base | Representation |
---|---|
bin | 1010010010111110110101… |
… | …1010100110111001011111 |
3 | 1111002022001102112000110210 |
4 | 2210233231122212321133 |
5 | 2440441330313001343 |
6 | 40024521513503503 |
7 | 2245634302140522 |
oct | 244575532467137 |
9 | 44068042460423 |
10 | 11321222000223 |
11 | 3675337748073 |
12 | 132a166411b93 |
13 | 641781b55735 |
14 | 2b1d42db8bb9 |
15 | 149757018333 |
hex | a4bed6a6e5f |
11321222000223 has 8 divisors (see below), whose sum is σ = 15502934631088. Its totient is φ = 7343495351424.
The previous prime is 11321222000213. The next prime is 11321222000239. The reversal of 11321222000223 is 32200022212311.
It is a sphenic number, since it is the product of 3 distinct primes.
It is not a de Polignac number, because 11321222000223 - 25 = 11321222000191 is a prime.
It is a Duffinian number.
It is a self number, because there is not a number n which added to its sum of digits gives 11321222000223.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (11321222000213) 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, 50996495386 + ... + 50996495607.
It is an arithmetic number, because the mean of its divisors is an integer number (1937866828886).
Almost surely, 211321222000223 is an apocalyptic number.
11321222000223 is a deficient number, since it is larger than the sum of its proper divisors (4181712630865).
11321222000223 is a wasteful number, since it uses less digits than its factorization.
11321222000223 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 101992991033.
The product of its (nonzero) digits is 576, while the sum is 21.
Adding to 11321222000223 its reverse (32200022212311), we get a palindrome (43521244212534).
The spelling of 11321222000223 in words is "eleven trillion, three hundred twenty-one billion, two hundred twenty-two million, two hundred twenty-three", and thus it is an aban number.
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.067 sec. • engine limits •