Base | Representation |
---|---|
bin | 1011001100000101110000… |
… | …0001000010010010011101 |
3 | 1121120002110112112001002220 |
4 | 2303001130001002102131 |
5 | 3103030133002024013 |
6 | 42055340141335553 |
7 | 2406546131366646 |
oct | 263013401022235 |
9 | 47502415461086 |
10 | 12302330111133 |
11 | 3a13430699087 |
12 | 14683355675b9 |
13 | 6b31491a707a |
14 | 30761638a6cd |
15 | 165029e4cb23 |
hex | b305c04249d |
12302330111133 has 8 divisors (see below), whose sum is σ = 16846434026208. Its totient is φ = 7979889801744.
The previous prime is 12302330111087. The next prime is 12302330111153. The reversal of 12302330111133 is 33111103320321.
It is a sphenic number, since it is the product of 3 distinct primes.
It is not a de Polignac number, because 12302330111133 - 216 = 12302330045597 is a prime.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (12302330111153) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (17) of ones.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 55415901291 + ... + 55415901512.
It is an arithmetic number, because the mean of its divisors is an integer number (2105804253276).
Almost surely, 212302330111133 is an apocalyptic number.
It is an amenable number.
12302330111133 is a deficient number, since it is larger than the sum of its proper divisors (4544103915075).
12302330111133 is a wasteful number, since it uses less digits than its factorization.
12302330111133 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 110831802843.
The product of its (nonzero) digits is 972, while the sum is 24.
Adding to 12302330111133 its reverse (33111103320321), we get a palindrome (45413433431454).
The spelling of 12302330111133 in words is "twelve trillion, three hundred two billion, three hundred thirty million, one hundred eleven thousand, one hundred thirty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.067 sec. • engine limits •