Base | Representation |
---|---|
bin | 1010010011100000011010… |
… | …0001101110001110001111 |
3 | 1111010011022102201221011001 |
4 | 2210320012201232032033 |
5 | 2441113304201331343 |
6 | 40033012015441131 |
7 | 2246403512263225 |
oct | 244700641561617 |
9 | 44104272657131 |
10 | 11330233230223 |
11 | 3679141309596 |
12 | 132ba602261a7 |
13 | 642589a383ab |
14 | 2b2559ab4b15 |
15 | 149ad31b244d |
hex | a4e0686e38f |
11330233230223 has 4 divisors (see below), whose sum is σ = 11436123260520. Its totient is φ = 11224343199928.
The previous prime is 11330233230209. The next prime is 11330233230247. The reversal of 11330233230223 is 32203233203311.
It is a semiprime because it is the product of two primes.
It is a cyclic number.
It is not a de Polignac number, because 11330233230223 - 217 = 11330233099151 is a prime.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 11330233230191 and 11330233230200.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (11330233230263) 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, 52945014988 + ... + 52945015201.
It is an arithmetic number, because the mean of its divisors is an integer number (2859030815130).
Almost surely, 211330233230223 is an apocalyptic number.
11330233230223 is a deficient number, since it is larger than the sum of its proper divisors (105890030297).
11330233230223 is a wasteful number, since it uses less digits than its factorization.
11330233230223 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 105890030296.
The product of its (nonzero) digits is 11664, while the sum is 28.
Adding to 11330233230223 its reverse (32203233203311), we get a palindrome (43533466433534).
The spelling of 11330233230223 in words is "eleven trillion, three hundred thirty billion, two hundred thirty-three million, two hundred thirty thousand, two hundred twenty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •