Base | Representation |
---|---|
bin | 11000100111000000… |
… | …01010110110010001 |
3 | 1021002202220022202100 |
4 | 30103200022312101 |
5 | 204024244231113 |
6 | 10023005111013 |
7 | 645260004624 |
oct | 142340126621 |
9 | 37082808670 |
10 | 13212102033 |
11 | 566a983899 |
12 | 2688858469 |
13 | 1327305570 |
14 | 8d49bbdbb |
15 | 524d9bd73 |
hex | 31380ad91 |
13212102033 has 24 divisors (see below), whose sum is σ = 20598013800. Its totient is φ = 8112384000.
The previous prime is 13212102017. The next prime is 13212102053. The reversal of 13212102033 is 33020121231.
It can be written as a sum of positive squares in 4 ways, for example, as 3565522944 + 9646579089 = 59712^2 + 98217^2 .
It is not a de Polignac number, because 13212102033 - 24 = 13212102017 is a prime.
It is a Curzon number.
It is a junction number, because it is equal to n+sod(n) for n = 13212101997 and 13212102015.
It is not an unprimeable number, because it can be changed into a prime (13212102053) by changing a digit.
It is a polite number, since it can be written in 23 ways as a sum of consecutive naturals, for example, 73218 + ... + 178283.
It is an arithmetic number, because the mean of its divisors is an integer number (858250575).
Almost surely, 213212102033 is an apocalyptic number.
13212102033 is a gapful number since it is divisible by the number (13) formed by its first and last digit.
It is an amenable number.
13212102033 is a deficient number, since it is larger than the sum of its proper divisors (7385911767).
13212102033 is a wasteful number, since it uses less digits than its factorization.
13212102033 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 251969 (or 251966 counting only the distinct ones).
The product of its (nonzero) digits is 216, while the sum is 18.
Adding to 13212102033 its reverse (33020121231), we get a palindrome (46232223264).
The spelling of 13212102033 in words is "thirteen billion, two hundred twelve million, one hundred two thousand, thirty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •