Base | Representation |
---|---|
bin | 11000101001100000… |
… | …00001000000001111 |
3 | 1021011020021201221220 |
4 | 30110300001000033 |
5 | 204100124030411 |
6 | 10025033454423 |
7 | 645632632545 |
oct | 142460010017 |
9 | 37136251856 |
10 | 13233033231 |
11 | 568077a800 |
12 | 2693871413 |
13 | 132b7537a2 |
14 | 8d76a9d95 |
15 | 526b33b06 |
hex | 314c0100f |
13233033231 has 72 divisors (see below), whose sum is σ = 20117509776. Its totient is φ = 7729920000.
The previous prime is 13233033199. The next prime is 13233033259.
13233033231 is nontrivially palindromic in base 10.
It is not a de Polignac number, because 13233033231 - 25 = 13233033199 is a prime.
It is a super-2 number, since 2×132330332312 (a number of 21 digits) contains 22 as substring.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (13233033431) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (11) of ones.
It is a polite number, since it can be written in 71 ways as a sum of consecutive naturals, for example, 131020081 + ... + 131020181.
It is an arithmetic number, because the mean of its divisors is an integer number (279409858).
Almost surely, 213233033231 is an apocalyptic number.
13233033231 is a gapful number since it is divisible by the number (11) formed by its first and last digit.
13233033231 is a deficient number, since it is larger than the sum of its proper divisors (6884476545).
13233033231 is a wasteful number, since it uses less digits than its factorization.
13233033231 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 345 (or 273 counting only the distinct ones).
The product of its (nonzero) digits is 2916, while the sum is 24.
It can be divided in two parts, 132330 and 33231, that added together give a palindrome (165561).
The spelling of 13233033231 in words is "thirteen billion, two hundred thirty-three million, thirty-three thousand, two hundred thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •