Base | Representation |
---|---|
bin | 1010010011000010100001… |
… | …0100011001111111011001 |
3 | 1111002101121022001022012021 |
4 | 2210300220110121333121 |
5 | 2441000341304331413 |
6 | 40025203535014441 |
7 | 2246000632020550 |
oct | 244605024317731 |
9 | 44071538038167 |
10 | 11322210230233 |
11 | 36757a4561991 |
12 | 132a3a136a421 |
13 | 6418ab801516 |
14 | 2b1dd8340d97 |
15 | 1497b3b7218d |
hex | a4c28519fd9 |
11322210230233 has 8 divisors (see below), whose sum is σ = 12962409909120. Its totient is φ = 9687695820000.
The previous prime is 11322210230213. The next prime is 11322210230297. The reversal of 11322210230233 is 33203201222311.
It is a sphenic number, since it is the product of 3 distinct primes.
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-11322210230233 is a prime.
It is a junction number, because it is equal to n+sod(n) for n = 11322210230198 and 11322210230207.
It is not an unprimeable number, because it can be changed into a prime (11322210230213) 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, 1421312893 + ... + 1421320858.
It is an arithmetic number, because the mean of its divisors is an integer number (1620301238640).
Almost surely, 211322210230233 is an apocalyptic number.
It is an amenable number.
11322210230233 is a deficient number, since it is larger than the sum of its proper divisors (1640199678887).
11322210230233 is an equidigital number, since it uses as much as digits as its factorization.
11322210230233 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 2842634327.
The product of its (nonzero) digits is 2592, while the sum is 25.
Adding to 11322210230233 its reverse (33203201222311), we get a palindrome (44525411452544).
The spelling of 11322210230233 in words is "eleven trillion, three hundred twenty-two billion, two hundred ten million, two hundred thirty thousand, two hundred thirty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.074 sec. • engine limits •