Base | Representation |
---|---|
bin | 10011100011110001… |
… | …010101011100010111 |
3 | 2000012121112000202011 |
4 | 103203301111130113 |
5 | 321002303330403 |
6 | 13351533125051 |
7 | 1342300340050 |
oct | 234361253427 |
9 | 60177460664 |
10 | 21001230103 |
11 | 89a7713017 |
12 | 40a1329787 |
13 | 1c98c55999 |
14 | 1033273727 |
15 | 82dae1a6d |
hex | 4e3c55717 |
21001230103 has 16 divisors (see below), whose sum is σ = 25054318080. Its totient is φ = 17211956256.
The previous prime is 21001230073. The next prime is 21001230137. The reversal of 21001230103 is 30103210012.
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-21001230103 is a prime.
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (21001260103) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 433768 + ... + 479746.
It is an arithmetic number, because the mean of its divisors is an integer number (1565894880).
Almost surely, 221001230103 is an apocalyptic number.
21001230103 is a gapful number since it is divisible by the number (23) formed by its first and last digit.
21001230103 is a deficient number, since it is larger than the sum of its proper divisors (4053087977).
21001230103 is a wasteful number, since it uses less digits than its factorization.
21001230103 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 48846.
The product of its (nonzero) digits is 36, while the sum is 13.
Adding to 21001230103 its reverse (30103210012), we get a palindrome (51104440115).
It can be divided in two parts, 210012 and 30103, that multiplied together give a palindrome (6321991236).
The spelling of 21001230103 in words is "twenty-one billion, one million, two hundred thirty thousand, one hundred three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.077 sec. • engine limits •