Base | Representation |
---|---|
bin | 11000101000001100… |
… | …11000101100010100 |
3 | 1021010110202022010000 |
4 | 30110012120230110 |
5 | 204034330321322 |
6 | 10024003531300 |
7 | 645441111300 |
oct | 142406305424 |
9 | 37113668100 |
10 | 13222120212 |
11 | 56755a6684 |
12 | 2690089b30 |
13 | 1329402492 |
14 | 8d6068d00 |
15 | 525bca3ac |
hex | 314198b14 |
13222120212 has 90 divisors (see below), whose sum is σ = 40208585802. Its totient is φ = 3777744096.
The previous prime is 13222120211. The next prime is 13222120231. The reversal of 13222120212 is 21202122231.
It can be written as a sum of positive squares in only one way, i.e., 13175825796 + 46294416 = 114786^2 + 6804^2 .
It is a Harshad number since it is a multiple of its sum of digits (18).
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (13222120211) 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 29 ways as a sum of consecutive naturals, for example, 400543 + ... + 432294.
Almost surely, 213222120212 is an apocalyptic number.
13222120212 is a gapful number since it is divisible by the number (12) formed by its first and last digit.
It is an amenable number.
13222120212 is an abundant number, since it is smaller than the sum of its proper divisors (26986465590).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
13222120212 is a wasteful number, since it uses less digits than its factorization.
13222120212 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 832867 (or 832849 counting only the distinct ones).
The product of its (nonzero) digits is 192, while the sum is 18.
Adding to 13222120212 its reverse (21202122231), we get a palindrome (34424242443).
The spelling of 13222120212 in words is "thirteen billion, two hundred twenty-two million, one hundred twenty thousand, two hundred twelve".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.074 sec. • engine limits •