Base | Representation |
---|---|
bin | 101111101111111011101101… |
… | …010010011111111010000111 |
3 | 1000112120000011021000001022120 |
4 | 233233323231102133322013 |
5 | 210011133311134120403 |
6 | 2022345345522301023 |
7 | 62143103050601124 |
oct | 5757735522377207 |
9 | 1015500137001276 |
10 | 210002112020103 |
11 | 60a05439545327 |
12 | 1b6779964b7773 |
13 | 9024163b53430 |
14 | 39c022944b74b |
15 | 1942984620e53 |
hex | befeed49fe87 |
210002112020103 has 8 divisors (see below), whose sum is σ = 301541494182768. Its totient is φ = 129232068935424.
The previous prime is 210002112020101. The next prime is 210002112020117. The reversal of 210002112020103 is 301020211200012.
It is a sphenic number, since it is the product of 3 distinct primes.
It is not a de Polignac number, because 210002112020103 - 21 = 210002112020101 is a prime.
It is a super-2 number, since 2×2100021120201032 (a number of 29 digits) contains 22 as substring.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (210002112020101) by changing a digit.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 2692334769450 + ... + 2692334769527.
It is an arithmetic number, because the mean of its divisors is an integer number (37692686772846).
Almost surely, 2210002112020103 is an apocalyptic number.
210002112020103 is a deficient number, since it is larger than the sum of its proper divisors (91539382162665).
210002112020103 is a wasteful number, since it uses less digits than its factorization.
210002112020103 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 5384669538993.
The product of its (nonzero) digits is 48, while the sum is 15.
Adding to 210002112020103 its reverse (301020211200012), we get a palindrome (511022323220115).
The spelling of 210002112020103 in words is "two hundred ten trillion, two billion, one hundred twelve million, twenty thousand, one hundred three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.081 sec. • engine limits •