Base | Representation |
---|---|
bin | 1100000110111000010000… |
… | …1110110000111011010000 |
3 | 1202010122102121122202122202 |
4 | 3001232010032300323100 |
5 | 3221102113430110412 |
6 | 44151332451222332 |
7 | 2542532515640312 |
oct | 301560416607320 |
9 | 52118377582582 |
10 | 13312322113232 |
11 | 42727a686604a |
12 | 15b00258a79a8 |
13 | 7574675bc88c |
14 | 3404698737b2 |
15 | 18143d9e23c2 |
hex | c1b843b0ed0 |
13312322113232 has 10 divisors (see below), whose sum is σ = 25792624094418. Its totient is φ = 6656161056608.
The previous prime is 13312322113231. The next prime is 13312322113253. The reversal of 13312322113232 is 23231122321331.
It can be written as a sum of positive squares in only one way, i.e., 8769984725056 + 4542337388176 = 2961416^2 + 2131276^2 .
It is a junction number, because it is equal to n+sod(n) for n = 13312322113195 and 13312322113204.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (13312322113231) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 416010066023 + ... + 416010066054.
Almost surely, 213312322113232 is an apocalyptic number.
It is an amenable number.
13312322113232 is a deficient number, since it is larger than the sum of its proper divisors (12480301981186).
13312322113232 is an equidigital number, since it uses as much as digits as its factorization.
13312322113232 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 832020132085 (or 832020132079 counting only the distinct ones).
The product of its digits is 7776, while the sum is 29.
Adding to 13312322113232 its reverse (23231122321331), we get a palindrome (36543444434563).
The spelling of 13312322113232 in words is "thirteen trillion, three hundred twelve billion, three hundred twenty-two million, one hundred thirteen thousand, two hundred thirty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.078 sec. • engine limits •