Base | Representation |
---|---|
bin | 10010110101011110… |
… | …00110101011000100 |
3 | 222002201221121200000 |
4 | 21122233012223010 |
5 | 131202212412012 |
6 | 4351232121300 |
7 | 505406361222 |
oct | 113257065304 |
9 | 28081847600 |
10 | 10112232132 |
11 | 431a100742 |
12 | 1b62696230 |
13 | c52024812 |
14 | 6bd019b12 |
15 | 3e2b7bddc |
hex | 25abc6ac4 |
10112232132 has 72 divisors (see below), whose sum is σ = 26524680000. Its totient is φ = 3368648736.
The previous prime is 10112232121. The next prime is 10112232139. The reversal of 10112232132 is 23123221101.
10112232132 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is a Harshad number since it is a multiple of its sum of digits (18).
It is not an unprimeable number, because it can be changed into a prime (10112232139) by changing a digit.
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 23 ways as a sum of consecutive naturals, for example, 2913294 + ... + 2916762.
Almost surely, 210112232132 is an apocalyptic number.
10112232132 is a gapful number since it is divisible by the number (12) formed by its first and last digit.
It is an amenable number.
10112232132 is an abundant number, since it is smaller than the sum of its proper divisors (16412447868).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
10112232132 is a wasteful number, since it uses less digits than its factorization.
10112232132 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 6487 (or 6473 counting only the distinct ones).
The product of its (nonzero) digits is 144, while the sum is 18.
Adding to 10112232132 its reverse (23123221101), we get a palindrome (33235453233).
The spelling of 10112232132 in words is "ten billion, one hundred twelve million, two hundred thirty-two thousand, one hundred thirty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.081 sec. • engine limits •