Base | Representation |
---|---|
bin | 1100000010010000110001… |
… | …0001011010011100000111 |
3 | 1201212001200112100112020110 |
4 | 3000210030101122130013 |
5 | 3213302141013132221 |
6 | 44051053434004103 |
7 | 2534024036132013 |
oct | 300441421323407 |
9 | 51761615315213 |
10 | 13233000130311 |
11 | 42420a1654265 |
12 | 1598788b76633 |
13 | 74cb35a9b300 |
14 | 33a6a2b8d543 |
15 | 17e349d02776 |
hex | c090c45a707 |
13233000130311 has 48 divisors (see below), whose sum is σ = 20578895779200. Its totient is φ = 7535371648896.
The previous prime is 13233000130303. The next prime is 13233000130321. The reversal of 13233000130311 is 11303100033231.
It is not a de Polignac number, because 13233000130311 - 23 = 13233000130303 is a prime.
It is a super-2 number, since 2×132330001303112 (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 (13233000130321) 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 47 ways as a sum of consecutive naturals, for example, 15559216 + ... + 16387653.
It is an arithmetic number, because the mean of its divisors is an integer number (428726995400).
Almost surely, 213233000130311 is an apocalyptic number.
13233000130311 is a deficient number, since it is larger than the sum of its proper divisors (7345895648889).
13233000130311 is a wasteful number, since it uses less digits than its factorization.
13233000130311 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 31946960 (or 31946947 counting only the distinct ones).
The product of its (nonzero) digits is 486, while the sum is 21.
Adding to 13233000130311 its reverse (11303100033231), we get a palindrome (24536100163542).
The spelling of 13233000130311 in words is "thirteen trillion, two hundred thirty-three billion, one hundred thirty thousand, three hundred eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •