Base | Representation |
---|---|
bin | 1011001100001001011001… |
… | …1111101011100101001001 |
3 | 1121120011222220122200201122 |
4 | 2303002112133223211021 |
5 | 3103034140133114423 |
6 | 42100021350125025 |
7 | 2406612343612511 |
oct | 263022637534511 |
9 | 47504886580648 |
10 | 12303311223113 |
11 | 3a13894491029 |
12 | 146856a050775 |
13 | 6b327452ccc1 |
14 | 3076aa7bc841 |
15 | 16508614c8c8 |
hex | b30967eb949 |
12303311223113 has 8 divisors (see below), whose sum is σ = 12635905496832. Its totient is φ = 11970720757296.
The previous prime is 12303311223109. The next prime is 12303311223121. The reversal of 12303311223113 is 31132211330321.
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 12303311223113 - 22 = 12303311223109 is a prime.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (12303311223163) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (23) of ones.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 6342806 + ... + 8052192.
It is an arithmetic number, because the mean of its divisors is an integer number (1579488187104).
Almost surely, 212303311223113 is an apocalyptic number.
It is an amenable number.
12303311223113 is a deficient number, since it is larger than the sum of its proper divisors (332594273719).
12303311223113 is a wasteful number, since it uses less digits than its factorization.
12303311223113 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1903951.
The product of its (nonzero) digits is 1944, while the sum is 26.
Adding to 12303311223113 its reverse (31132211330321), we get a palindrome (43435522553434).
The spelling of 12303311223113 in words is "twelve trillion, three hundred three billion, three hundred eleven million, two hundred twenty-three thousand, one hundred thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.075 sec. • engine limits •