Base | Representation |
---|---|
bin | 1100000010010000111000… |
… | …1100010000011011101001 |
3 | 1201212001202202221121001212 |
4 | 3000210032030100123221 |
5 | 3213302222234124113 |
6 | 44051100544122505 |
7 | 2534024606633342 |
oct | 300441614203351 |
9 | 51761682847055 |
10 | 13233032333033 |
11 | 4242108849687 |
12 | 1598797906435 |
13 | 74cb3c664a86 |
14 | 33a6a71730c9 |
15 | 17e34ca640a8 |
hex | c090e3106e9 |
13233032333033 has 64 divisors (see below), whose sum is σ = 15314085752832. Its totient is φ = 11359691735040.
The previous prime is 13233032332991. The next prime is 13233032333051. The reversal of 13233032333033 is 33033323033231.
It is a cyclic number.
It is not a de Polignac number, because 13233032333033 - 214 = 13233032316649 is a prime.
It is a super-2 number, since 2×132330323330332 (a number of 27 digits) contains 22 as substring.
It is not an unprimeable number, because it can be changed into a prime (13233032333233) 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 63 ways as a sum of consecutive naturals, for example, 970654985 + ... + 970668617.
It is an arithmetic number, because the mean of its divisors is an integer number (239282589888).
Almost surely, 213233032333033 is an apocalyptic number.
It is an amenable number.
13233032333033 is a deficient number, since it is larger than the sum of its proper divisors (2081053419799).
13233032333033 is a wasteful number, since it uses less digits than its factorization.
13233032333033 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 14874.
The product of its (nonzero) digits is 78732, while the sum is 32.
Adding to 13233032333033 its reverse (33033323033231), we get a palindrome (46266355366264).
The spelling of 13233032333033 in words is "thirteen trillion, two hundred thirty-three billion, thirty-two million, three hundred thirty-three thousand, thirty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •