Base | Representation |
---|---|
bin | 11000100110111010… |
… | …00111010101110001 |
3 | 1021002201101122021002 |
4 | 30103131013111301 |
5 | 204024043114413 |
6 | 10022540011345 |
7 | 645250131134 |
oct | 142335072561 |
9 | 37081348232 |
10 | 13211301233 |
11 | 566a487179 |
12 | 2688530b55 |
13 | 13270b4c10 |
14 | 8d485021b |
15 | 524c8e958 |
hex | 313747571 |
13211301233 has 8 divisors (see below), whose sum is σ = 14230809768. Its totient is φ = 12192257664.
The previous prime is 13211301167. The next prime is 13211301241. The reversal of 13211301233 is 33210311231.
It can be written as a sum of positive squares in 4 ways, for example, as 4814694544 + 8396606689 = 69388^2 + 91633^2 .
It is a sphenic number, since it is the product of 3 distinct primes.
It is a cyclic number.
It is not a de Polignac number, because 13211301233 - 212 = 13211297137 is a prime.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (13211301253) by changing a digit.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 56066 + ... + 171947.
It is an arithmetic number, because the mean of its divisors is an integer number (1778851221).
Almost surely, 213211301233 is an apocalyptic number.
13211301233 is a gapful number since it is divisible by the number (13) formed by its first and last digit.
It is an amenable number.
13211301233 is a deficient number, since it is larger than the sum of its proper divisors (1019508535).
13211301233 is a wasteful number, since it uses less digits than its factorization.
13211301233 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 232483.
The product of its (nonzero) digits is 324, while the sum is 20.
Adding to 13211301233 its reverse (33210311231), we get a palindrome (46421612464).
The spelling of 13211301233 in words is "thirteen billion, two hundred eleven million, three hundred one thousand, two hundred thirty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.074 sec. • engine limits •