Base | Representation |
---|---|
bin | 11000101000000101… |
… | …11011001110110110 |
3 | 1021010102001012210122 |
4 | 30110002323032312 |
5 | 204034112304420 |
6 | 10023532251542 |
7 | 645430312550 |
oct | 142402731666 |
9 | 37112035718 |
10 | 13221213110 |
11 | 5675037106 |
12 | 268b910bb2 |
13 | 1329175631 |
14 | 8d5cb04d0 |
15 | 525a9b725 |
hex | 3140bb3b6 |
13221213110 has 32 divisors (see below), whose sum is σ = 27202443840. Its totient is φ = 4532234112.
The previous prime is 13221213077. The next prime is 13221213127. The reversal of 13221213110 is 1131212231.
13221213110 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is a super-2 number, since 2×132212131102 (a number of 21 digits) contains 22 as substring.
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 15 ways as a sum of consecutive naturals, for example, 556556 + ... + 579824.
It is an arithmetic number, because the mean of its divisors is an integer number (850076370).
Almost surely, 213221213110 is an apocalyptic number.
13221213110 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
13221213110 is an abundant number, since it is smaller than the sum of its proper divisors (13981230730).
13221213110 is a wasteful number, since it uses less digits than its factorization.
13221213110 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 31400.
The product of its (nonzero) digits is 72, while the sum is 17.
Adding to 13221213110 its reverse (1131212231), we get a palindrome (14352425341).
It can be divided in two parts, 1322121 and 3110, that added together give a palindrome (1325231).
The spelling of 13221213110 in words is "thirteen billion, two hundred twenty-one million, two hundred thirteen thousand, one hundred ten".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.075 sec. • engine limits •