Base | Representation |
---|---|
bin | 1010001101010000111011… |
… | …1011111010011000111101 |
3 | 1110201220112011202002021110 |
4 | 2203110032323322120331 |
5 | 2432334201013144013 |
6 | 35511435230152233 |
7 | 2235556256054250 |
oct | 243241673723075 |
9 | 43656464662243 |
10 | 11223000131133 |
11 | 3637713a9a04a |
12 | 1313114052679 |
13 | 63542a849c7b |
14 | 2ab2a617b097 |
15 | 146e08e672c3 |
hex | a350eefa63d |
11223000131133 has 16 divisors (see below), whose sum is σ = 17118464483456. Its totient is φ = 6406861682880.
The previous prime is 11223000131129. The next prime is 11223000131159. The reversal of 11223000131133 is 33113100032211.
It is a happy number.
It is not a de Polignac number, because 11223000131133 - 22 = 11223000131129 is a prime.
It is a super-2 number, since 2×112230001311332 (a number of 27 digits) contains 22 as substring.
It is a Harshad number since it is a multiple of its sum of digits (21).
It is a Curzon number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (11223000131173) by changing a digit.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 261696766 + ... + 261739647.
It is an arithmetic number, because the mean of its divisors is an integer number (1069904030216).
Almost surely, 211223000131133 is an apocalyptic number.
It is an amenable number.
11223000131133 is a deficient number, since it is larger than the sum of its proper divisors (5895464352323).
11223000131133 is a wasteful number, since it uses less digits than its factorization.
11223000131133 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 523437444.
The product of its (nonzero) digits is 324, while the sum is 21.
Adding to 11223000131133 its reverse (33113100032211), we get a palindrome (44336100163344).
The spelling of 11223000131133 in words is "eleven trillion, two hundred twenty-three billion, one hundred thirty-one thousand, one hundred thirty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •