Base | Representation |
---|---|
bin | 10010110111110110… |
… | …10100011001111000 |
3 | 222011010112122221221 |
4 | 21123323110121320 |
5 | 131222321230240 |
6 | 4353224241424 |
7 | 506041242460 |
oct | 113373243170 |
9 | 28133478857 |
10 | 10132211320 |
11 | 432a407370 |
12 | 1b69310274 |
13 | c561cb61a |
14 | 6c193aba0 |
15 | 3e47c6a4a |
hex | 25bed4678 |
10132211320 has 128 divisors (see below), whose sum is σ = 29918937600. Its totient is φ = 2991859200.
The previous prime is 10132211311. The next prime is 10132211351. The reversal of 10132211320 is 2311223101.
It is a super-2 number, since 2×101322113202 (a number of 21 digits) contains 22 as substring.
It is a junction number, because it is equal to n+sod(n) for n = 10132211294 and 10132211303.
It is a congruent number.
It is an unprimeable number.
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 in 31 ways as a sum of consecutive naturals, for example, 28051 + ... + 145090.
It is an arithmetic number, because the mean of its divisors is an integer number (233741700).
Almost surely, 210132211320 is an apocalyptic number.
10132211320 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
It is an amenable number.
10132211320 is an abundant number, since it is smaller than the sum of its proper divisors (19786726280).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
10132211320 is a wasteful number, since it uses less digits than its factorization.
10132211320 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 173189 (or 173185 counting only the distinct ones).
The product of its (nonzero) digits is 72, while the sum is 16.
Adding to 10132211320 its reverse (2311223101), we get a palindrome (12443434421).
The spelling of 10132211320 in words is "ten billion, one hundred thirty-two million, two hundred eleven thousand, three hundred twenty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •