Base | Representation |
---|---|
bin | 10010110100000001… |
… | …10101011111011100 |
3 | 222001220010101210210 |
4 | 21122000311133130 |
5 | 131141111300012 |
6 | 4350120132420 |
7 | 505201313550 |
oct | 113200653734 |
9 | 28056111723 |
10 | 10100103132 |
11 | 4313276a79 |
12 | 1b5a607110 |
13 | c4c668bb2 |
14 | 6bb57d860 |
15 | 3e1a8323c |
hex | 25a0357dc |
10100103132 has 48 divisors (see below), whose sum is σ = 26938759680. Its totient is φ = 2885191872.
The previous prime is 10100103107. The next prime is 10100103179. The reversal of 10100103132 is 23130100101.
10100103132 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 (12).
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, 667798 + ... + 682754.
It is an arithmetic number, because the mean of its divisors is an integer number (561224160).
Almost surely, 210100103132 is an apocalyptic number.
10100103132 is a gapful number since it is divisible by the number (12) formed by its first and last digit.
It is an amenable number.
10100103132 is an abundant number, since it is smaller than the sum of its proper divisors (16838656548).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
10100103132 is a wasteful number, since it uses less digits than its factorization.
10100103132 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 23010 (or 23008 counting only the distinct ones).
The product of its (nonzero) digits is 18, while the sum is 12.
Adding to 10100103132 its reverse (23130100101), we get a palindrome (33230203233).
The spelling of 10100103132 in words is "ten billion, one hundred million, one hundred three thousand, one hundred thirty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •