Base | Representation |
---|---|
bin | 1010001101110010100010… |
… | …1100011010111010001001 |
3 | 1110202202210221101021212022 |
4 | 2203130220230122322021 |
5 | 2433011140141242413 |
6 | 35515530400454225 |
7 | 2236325660352554 |
oct | 243345054327211 |
9 | 43682727337768 |
10 | 11232022212233 |
11 | 36405237a2119 |
12 | 1314a1161a375 |
13 | 636237a5b9b4 |
14 | 2ab8c049d69b |
15 | 147286056608 |
hex | a3728b1ae89 |
11232022212233 has 8 divisors (see below), whose sum is σ = 11301148963368. Its totient is φ = 11163008139264.
The previous prime is 11232022212217. The next prime is 11232022212287. The reversal of 11232022212233 is 33221222023211.
It can be written as a sum of positive squares in 4 ways, for example, as 4847976083344 + 6384046128889 = 2201812^2 + 2526667^2 .
It is a sphenic number, since it is the product of 3 distinct primes.
It is a cyclic number.
It is not a de Polignac number, because 11232022212233 - 24 = 11232022212217 is a prime.
It is not an unprimeable number, because it can be changed into a prime (11232022212293) 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, 27969560 + ... + 28368297.
It is an arithmetic number, because the mean of its divisors is an integer number (1412643620421).
Almost surely, 211232022212233 is an apocalyptic number.
It is an amenable number.
11232022212233 is a deficient number, since it is larger than the sum of its proper divisors (69126751135).
11232022212233 is a wasteful number, since it uses less digits than its factorization.
11232022212233 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 56339083.
The product of its (nonzero) digits is 3456, while the sum is 26.
Adding to 11232022212233 its reverse (33221222023211), we get a palindrome (44453244235444).
The spelling of 11232022212233 in words is "eleven trillion, two hundred thirty-two billion, twenty-two million, two hundred twelve thousand, two hundred thirty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.075 sec. • engine limits •