Base | Representation |
---|---|
bin | 111101100001001… |
… | …100011111100101 |
3 | 2122221002201122010 |
4 | 331201030133211 |
5 | 4103210041401 |
6 | 250225424433 |
7 | 34401544116 |
oct | 7541143745 |
9 | 2587081563 |
10 | 1032112101 |
11 | 48a667109 |
12 | 24979b119 |
13 | 135aa1627 |
14 | 9b10a20d |
15 | 60925ed6 |
hex | 3d84c7e5 |
1032112101 has 8 divisors (see below), whose sum is σ = 1408153120. Its totient is φ = 672072912.
The previous prime is 1032112099. The next prime is 1032112141. The reversal of 1032112101 is 1012112301.
It is a sphenic number, since it is the product of 3 distinct primes.
It is not a de Polignac number, because 1032112101 - 21 = 1032112099 is a prime.
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (1032112141) 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 7 ways as a sum of consecutive naturals, for example, 4000306 + ... + 4000563.
It is an arithmetic number, because the mean of its divisors is an integer number (176019140).
Almost surely, 21032112101 is an apocalyptic number.
It is an amenable number.
1032112101 is a deficient number, since it is larger than the sum of its proper divisors (376041019).
1032112101 is an equidigital number, since it uses as much as digits as its factorization.
1032112101 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 8000915.
The product of its (nonzero) digits is 12, while the sum is 12.
The square root of 1032112101 is about 32126.5015368932. The cubic root of 1032112101 is about 1010.5914586245.
Adding to 1032112101 its reverse (1012112301), we get a palindrome (2044224402).
It can be divided in two parts, 10321 and 12101, that added together give a palindrome (22422).
The spelling of 1032112101 in words is "one billion, thirty-two million, one hundred twelve thousand, one hundred one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •