Base | Representation |
---|---|
bin | 11000101001100001… |
… | …10011100100000001 |
3 | 1021011020200021000220 |
4 | 30110300303210001 |
5 | 204100202142241 |
6 | 10025042133253 |
7 | 645634454400 |
oct | 142460634401 |
9 | 37136607026 |
10 | 13233240321 |
11 | 5680901354 |
12 | 2693951229 |
13 | 132b7c6b22 |
14 | 8d7721637 |
15 | 526b75166 |
hex | 314c33901 |
13233240321 has 12 divisors (see below), whose sum is σ = 20525026032. Its totient is φ = 7561851528.
The previous prime is 13233240271. The next prime is 13233240337. The reversal of 13233240321 is 12304233231.
It is not a de Polignac number, because 13233240321 - 27 = 13233240193 is a prime.
It is a super-3 number, since 3×132332403213 (a number of 31 digits) contains 333 as substring.
It is a junction number, because it is equal to n+sod(n) for n = 13233240291 and 13233240300.
It is not an unprimeable number, because it can be changed into a prime (13233240221) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (13) of ones.
It is a polite number, since it can be written in 11 ways as a sum of consecutive naturals, for example, 45010875 + ... + 45011168.
It is an arithmetic number, because the mean of its divisors is an integer number (1710418836).
Almost surely, 213233240321 is an apocalyptic number.
It is an amenable number.
13233240321 is a deficient number, since it is larger than the sum of its proper divisors (7291785711).
13233240321 is an equidigital number, since it uses as much as digits as its factorization.
13233240321 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 90022060 (or 90022053 counting only the distinct ones).
The product of its (nonzero) digits is 2592, while the sum is 24.
Adding to 13233240321 its reverse (12304233231), we get a palindrome (25537473552).
The spelling of 13233240321 in words is "thirteen billion, two hundred thirty-three million, two hundred forty thousand, three hundred twenty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •