Base | Representation |
---|---|
bin | 1100000010010001100011… |
… | …1010000011100010110110 |
3 | 1201212002020022020021010012 |
4 | 3000210120322003202312 |
5 | 3213303104300023110 |
6 | 44051130445300222 |
7 | 2534032222005422 |
oct | 300443072034266 |
9 | 51762208207105 |
10 | 13233212111030 |
11 | 42421a027a53a |
12 | 1598827b64672 |
13 | 74cb6a98b8a2 |
14 | 33a6c2dadb82 |
15 | 17e35d726905 |
hex | c0918e838b6 |
13233212111030 has 32 divisors (see below), whose sum is σ = 24326991304704. Its totient is φ = 5180575377376.
The previous prime is 13233212111011. The next prime is 13233212111039. The reversal of 13233212111030 is 3011121233231.
It is a super-2 number, since 2×132332121110302 (a number of 27 digits) contains 22 as substring.
It is a junction number, because it is equal to n+sod(n) for n = 13233212110987 and 13233212111005.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (13233212111039) by changing a digit.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 32974559 + ... + 33373461.
It is an arithmetic number, because the mean of its divisors is an integer number (760218478272).
Almost surely, 213233212111030 is an apocalyptic number.
13233212111030 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
13233212111030 is a deficient number, since it is larger than the sum of its proper divisors (11093779193674).
13233212111030 is a wasteful number, since it uses less digits than its factorization.
13233212111030 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 469540.
The product of its (nonzero) digits is 648, while the sum is 23.
Adding to 13233212111030 its reverse (3011121233231), we get a palindrome (16244333344261).
The spelling of 13233212111030 in words is "thirteen trillion, two hundred thirty-three billion, two hundred twelve million, one hundred eleven thousand, thirty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •