Base | Representation |
---|---|
bin | 1011000110111001000001… |
… | …0011010101111101101101 |
3 | 1121020112220212122022022121 |
4 | 2301232100103111331231 |
5 | 3100044222312343313 |
6 | 41550325234112541 |
7 | 2400234563521000 |
oct | 261562023257555 |
9 | 47215825568277 |
10 | 12213013012333 |
11 | 39895674a8851 |
12 | 1452b6941b751 |
13 | 6a78b39b8453 |
14 | 303182055537 |
15 | 162a4da1728d |
hex | b1b904d5f6d |
12213013012333 has 8 divisors (see below), whose sum is σ = 14242580772800. Its totient is φ = 10468296867420.
The previous prime is 12213013012313. The next prime is 12213013012339. The reversal of 12213013012333 is 33321031031221.
It is not a de Polignac number, because 12213013012333 - 29 = 12213013011821 is a prime.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 12213013012298 and 12213013012307.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (12213013012339) 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, 17803225623 + ... + 17803226308.
It is an arithmetic number, because the mean of its divisors is an integer number (1780322596600).
Almost surely, 212213013012333 is an apocalyptic number.
It is an amenable number.
12213013012333 is a deficient number, since it is larger than the sum of its proper divisors (2029567760467).
12213013012333 is an frugal number, since it uses more digits than its factorization.
12213013012333 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 35606451952 (or 35606451938 counting only the distinct ones).
The product of its (nonzero) digits is 1944, while the sum is 25.
Adding to 12213013012333 its reverse (33321031031221), we get a palindrome (45534044043554).
The spelling of 12213013012333 in words is "twelve trillion, two hundred thirteen billion, thirteen million, twelve thousand, three hundred thirty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.078 sec. • engine limits •