Base | Representation |
---|---|
bin | 1010010011100000010010… |
… | …1010101000101000111111 |
3 | 1111010011020020222220002211 |
4 | 2210320010222220220333 |
5 | 2441113223203342343 |
6 | 40033004542401251 |
7 | 2246402653032523 |
oct | 244700452505077 |
9 | 44104206886084 |
10 | 11330202012223 |
11 | 3679125726a96 |
12 | 132ba51890227 |
13 | 642583427bc3 |
14 | 2b25558a9d83 |
15 | 149ad059779d |
hex | a4e04aa8a3f |
11330202012223 has 4 divisors (see below), whose sum is σ = 11332644397120. Its totient is φ = 11327759627328.
The previous prime is 11330202012203. The next prime is 11330202012229. The reversal of 11330202012223 is 32221020203311.
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 11330202012223 - 25 = 11330202012191 is a prime.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 11330202012194 and 11330202012203.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (11330202012229) 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, 1221185490 + ... + 1221194767.
It is an arithmetic number, because the mean of its divisors is an integer number (2833161099280).
Almost surely, 211330202012223 is an apocalyptic number.
11330202012223 is a deficient number, since it is larger than the sum of its proper divisors (2442384897).
11330202012223 is an equidigital number, since it uses as much as digits as its factorization.
11330202012223 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 2442384896.
The product of its (nonzero) digits is 864, while the sum is 22.
Adding to 11330202012223 its reverse (32221020203311), we get a palindrome (43551222215534).
The spelling of 11330202012223 in words is "eleven trillion, three hundred thirty billion, two hundred two million, twelve thousand, two hundred twenty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.075 sec. • engine limits •