Base | Representation |
---|---|
bin | 1001100011011110110010… |
… | …11000000010011100110111 |
3 | 2202101120100011101000112100 |
4 | 10301233121120002130313 |
5 | 10223213124443031403 |
6 | 112404002511153143 |
7 | 4265642420240013 |
oct | 461573130023467 |
9 | 82346304330470 |
10 | 21010332002103 |
11 | 677048274a044 |
12 | 2433b398157b3 |
13 | b9535bc90b92 |
14 | 528c9696b543 |
15 | 2667d86db2a3 |
hex | 131bd9602737 |
21010332002103 has 12 divisors (see below), whose sum is σ = 30379130449200. Its totient is φ = 13992638872416.
The previous prime is 21010332002057. The next prime is 21010332002117. The reversal of 21010332002103 is 30120023301012.
21010332002103 is a `hidden beast` number, since 210 + 10 + 33 + 200 + 210 + 3 = 666.
It is not a de Polignac number, because 21010332002103 - 216 = 21010331936567 is a prime.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (21010332003103) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (23) of ones.
It is a polite number, since it can be written in 11 ways as a sum of consecutive naturals, for example, 1187418078 + ... + 1187435771.
It is an arithmetic number, because the mean of its divisors is an integer number (2531594204100).
Almost surely, 221010332002103 is an apocalyptic number.
21010332002103 is a deficient number, since it is larger than the sum of its proper divisors (9368798447097).
21010332002103 is a wasteful number, since it uses less digits than its factorization.
21010332002103 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 2374854838 (or 2374854835 counting only the distinct ones).
The product of its (nonzero) digits is 216, while the sum is 18.
Adding to 21010332002103 its reverse (30120023301012), we get a palindrome (51130355303115).
The spelling of 21010332002103 in words is "twenty-one trillion, ten billion, three hundred thirty-two million, two thousand, one hundred three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •