Base | Representation |
---|---|
bin | 101111011111110111… |
… | …0111100011001110111 |
3 | 100202021121212210002201 |
4 | 1132333232330121313 |
5 | 3132344224031403 |
6 | 114505243245331 |
7 | 10240452132610 |
oct | 1367756743167 |
9 | 322247783081 |
10 | 102001002103 |
11 | 3a2929a7650 |
12 | 17927b19847 |
13 | 9807247c60 |
14 | 4d18adac07 |
15 | 29bec4921d |
hex | 17bfbbc677 |
102001002103 has 32 divisors (see below), whose sum is σ = 137109030912. Its totient is φ = 73283443200.
The previous prime is 102001002041. The next prime is 102001002107. The reversal of 102001002103 is 301200100201.
It is a de Polignac number, because none of the positive numbers 2k-102001002103 is a prime.
It is a self number, because there is not a number n which added to its sum of digits gives 102001002103.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (102001002107) by changing a digit.
It is a polite number, since it can be written in 31 ways as a sum of consecutive naturals, for example, 824050 + ... + 939712.
It is an arithmetic number, because the mean of its divisors is an integer number (4284657216).
Almost surely, 2102001002103 is an apocalyptic number.
102001002103 is a gapful number since it is divisible by the number (13) formed by its first and last digit.
102001002103 is a deficient number, since it is larger than the sum of its proper divisors (35108028809).
102001002103 is a wasteful number, since it uses less digits than its factorization.
102001002103 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 116575.
The product of its (nonzero) digits is 12, while the sum is 10.
Adding to 102001002103 its reverse (301200100201), we get a palindrome (403201102304).
The spelling of 102001002103 in words is "one hundred two billion, one million, two thousand, one hundred three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •