Base | Representation |
---|---|
bin | 101111011111111011… |
… | …0111101000110110100 |
3 | 100202021202211110210120 |
4 | 1132333312331012310 |
5 | 3132400243232012 |
6 | 114505400251540 |
7 | 10240506030261 |
oct | 1367766750664 |
9 | 322252743716 |
10 | 102003102132 |
11 | 3a294101408 |
12 | 17928770bb0 |
13 | 9807801a89 |
14 | 4d190c6268 |
15 | 29c001158c |
hex | 17bfdbd1b4 |
102003102132 has 48 divisors (see below), whose sum is σ = 251499171840. Its totient is φ = 32111041248.
The previous prime is 102003102127. The next prime is 102003102133. The reversal of 102003102132 is 231201300201.
102003102132 is digitally balanced in base 3, because in such base it contains all the possibile digits an equal number of times.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (102003102133) by changing a digit.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 2317288 + ... + 2360895.
It is an arithmetic number, because the mean of its divisors is an integer number (5239566080).
Almost surely, 2102003102132 is an apocalyptic number.
102003102132 is a gapful number since it is divisible by the number (12) formed by its first and last digit.
It is an amenable number.
102003102132 is an abundant number, since it is smaller than the sum of its proper divisors (149496069708).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
102003102132 is a wasteful number, since it uses less digits than its factorization.
102003102132 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 4678292 (or 4678290 counting only the distinct ones).
The product of its (nonzero) digits is 72, while the sum is 15.
Adding to 102003102132 its reverse (231201300201), we get a palindrome (333204402333).
The spelling of 102003102132 in words is "one hundred two billion, three million, one hundred two thousand, one hundred thirty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •