Base | Representation |
---|---|
bin | 1100000010010001100011… |
… | …1010000011100010011101 |
3 | 1201212002020022020021002021 |
4 | 3000210120322003202131 |
5 | 3213303104300023010 |
6 | 44051130445300141 |
7 | 2534032222005355 |
oct | 300443072034235 |
9 | 51762208207067 |
10 | 13233212111005 |
11 | 42421a027a517 |
12 | 1598827b64651 |
13 | 74cb6a98b883 |
14 | 33a6c2dadb65 |
15 | 17e35d7268da |
hex | c0918e8389d |
13233212111005 has 8 divisors (see below), whose sum is σ = 16149004610400. Its totient is φ = 10407136304016.
The previous prime is 13233212111003. The next prime is 13233212111011. The reversal of 13233212111005 is 50011121233231.
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 13233212111005 - 21 = 13233212111003 is a prime.
It is a super-2 number, since 2×132332121110052 (a number of 27 digits) contains 22 as substring.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (13233212111003) 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, 22429172775 + ... + 22429173364.
It is an arithmetic number, because the mean of its divisors is an integer number (2018625576300).
Almost surely, 213233212111005 is an apocalyptic number.
It is an amenable number.
13233212111005 is a deficient number, since it is larger than the sum of its proper divisors (2915792499395).
13233212111005 is an equidigital number, since it uses as much as digits as its factorization.
13233212111005 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 44858346203.
The product of its (nonzero) digits is 1080, while the sum is 25.
Adding to 13233212111005 its reverse (50011121233231), we get a palindrome (63244333344236).
The spelling of 13233212111005 in words is "thirteen trillion, two hundred thirty-three billion, two hundred twelve million, one hundred eleven thousand, five".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.074 sec. • engine limits •