Base | Representation |
---|---|
bin | 11000110101010110… |
… | …00110111100010100 |
3 | 1021102011021121102212 |
4 | 30122223012330110 |
5 | 204301044111012 |
6 | 10042543452552 |
7 | 651250421246 |
oct | 143253067424 |
9 | 37364247385 |
10 | 13332410132 |
11 | 5721886078 |
12 | 2700bb7158 |
13 | 13462097a2 |
14 | 906978096 |
15 | 530713b22 |
hex | 31aac6f14 |
13332410132 has 12 divisors (see below), whose sum is σ = 23679952800. Its totient is φ = 6566709336.
The previous prime is 13332410111. The next prime is 13332410153. The reversal of 13332410132 is 23101423331.
13332410132 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is an interprime number because it is at equal distance from previous prime (13332410111) and next prime (13332410153).
It is a junction number, because it is equal to n+sod(n) for n = 13332410098 and 13332410107.
It is a congruent number.
It is an unprimeable number.
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 3 ways as a sum of consecutive naturals, for example, 24873632 + ... + 24874167.
It is an arithmetic number, because the mean of its divisors is an integer number (1973329400).
Almost surely, 213332410132 is an apocalyptic number.
It is an amenable number.
13332410132 is a deficient number, since it is larger than the sum of its proper divisors (10347542668).
13332410132 is a wasteful number, since it uses less digits than its factorization.
13332410132 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 49747870 (or 49747868 counting only the distinct ones).
The product of its (nonzero) digits is 1296, while the sum is 23.
Adding to 13332410132 its reverse (23101423331), we get a palindrome (36433833463).
The spelling of 13332410132 in words is "thirteen billion, three hundred thirty-two million, four hundred ten thousand, one hundred thirty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •