Base | Representation |
---|---|
bin | 1010010001111011110001… |
… | …1110010001111011001011 |
3 | 1111000120120220110222021202 |
4 | 2210132330132101323023 |
5 | 2440142444034310443 |
6 | 40012343354054415 |
7 | 2244426232223030 |
oct | 244367436217313 |
9 | 44016526428252 |
10 | 11303221010123 |
11 | 366873a649849 |
12 | 1326781a1a40b |
13 | 63cb736695c3 |
14 | 2b11163b1387 |
15 | 149051a167b8 |
hex | a47bc791ecb |
11303221010123 has 8 divisors (see below), whose sum is σ = 12919170529248. Its totient is φ = 9687572406144.
The previous prime is 11303221010113. The next prime is 11303221010143. The reversal of 11303221010123 is 32101012230311.
It is a happy number.
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 11303221010123 - 220 = 11303219961547 is a prime.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 11303221010095 and 11303221010104.
It is not an unprimeable number, because it can be changed into a prime (11303221010113) 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, 75148286 + ... + 75298547.
It is an arithmetic number, because the mean of its divisors is an integer number (1614896316156).
Almost surely, 211303221010123 is an apocalyptic number.
11303221010123 is a deficient number, since it is larger than the sum of its proper divisors (1615949519125).
11303221010123 is a wasteful number, since it uses less digits than its factorization.
11303221010123 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 150457573.
The product of its (nonzero) digits is 216, while the sum is 20.
Adding to 11303221010123 its reverse (32101012230311), we get a palindrome (43404233240434).
The spelling of 11303221010123 in words is "eleven trillion, three hundred three billion, two hundred twenty-one million, ten thousand, one hundred twenty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.324 sec. • engine limits •