Base | Representation |
---|---|
bin | 1100010101111000100… |
… | …1110010000011000111 |
3 | 202021021221112102220122 |
4 | 3011132021302003013 |
5 | 11433220423120403 |
6 | 241223455252155 |
7 | 21214242635162 |
oct | 3053611620307 |
9 | 667257472818 |
10 | 212033020103 |
11 | 81a17126313 |
12 | 3511551a05b |
13 | 16cc1275508 |
14 | a396256ad9 |
15 | 57aea68838 |
hex | 315e2720c7 |
212033020103 has 8 divisors (see below), whose sum is σ = 232896681600. Its totient is φ = 192139761528.
The previous prime is 212033020063. The next prime is 212033020117. The reversal of 212033020103 is 301020330212.
It is a sphenic number, since it is the product of 3 distinct primes.
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-212033020103 is a prime.
It is a super-2 number, since 2×2120330201032 (a number of 23 digits) contains 22 as substring.
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (212033020193) 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, 242600273 + ... + 242601146.
It is an arithmetic number, because the mean of its divisors is an integer number (29112085200).
Almost surely, 2212033020103 is an apocalyptic number.
212033020103 is a gapful number since it is divisible by the number (23) formed by its first and last digit.
212033020103 is a deficient number, since it is larger than the sum of its proper divisors (20863661497).
212033020103 is a wasteful number, since it uses less digits than its factorization.
212033020103 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 485201461.
The product of its (nonzero) digits is 216, while the sum is 17.
Adding to 212033020103 its reverse (301020330212), we get a palindrome (513053350315).
The spelling of 212033020103 in words is "two hundred twelve billion, thirty-three million, twenty thousand, one hundred three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.063 sec. • engine limits •