Base | Representation |
---|---|
bin | 1001100011100010000101… |
… | …10101000010001101100111 |
3 | 2202101201220110110010212011 |
4 | 10301301002311002031213 |
5 | 10223230240402222413 |
6 | 112404454231335051 |
7 | 4266034312252261 |
oct | 461610265021547 |
9 | 82351813403764 |
10 | 21012101210983 |
11 | 6771200392943 |
12 | 2434352221487 |
13 | b9558168cb3c |
14 | 528dc390ab31 |
15 | 26688dbb133d |
hex | 131c42d42367 |
21012101210983 has 8 divisors (see below), whose sum is σ = 21090028836240. Its totient is φ = 20934296211840.
The previous prime is 21012101210963. The next prime is 21012101211007. The reversal of 21012101210983 is 38901210121012.
It is a sphenic number, since it is the product of 3 distinct primes.
It is a cyclic number.
It is not a de Polignac number, because 21012101210983 - 213 = 21012101202791 is a prime.
It is an alternating number because its digits alternate between even and odd.
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (21012101210923) 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, 30313185 + ... + 30998602.
It is an arithmetic number, because the mean of its divisors is an integer number (2636253604530).
Almost surely, 221012101210983 is an apocalyptic number.
21012101210983 is a deficient number, since it is larger than the sum of its proper divisors (77927625257).
21012101210983 is an equidigital number, since it uses as much as digits as its factorization.
21012101210983 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 61313057.
The product of its (nonzero) digits is 1728, while the sum is 31.
Adding to 21012101210983 its reverse (38901210121012), we get a palindrome (59913311331995).
The spelling of 21012101210983 in words is "twenty-one trillion, twelve billion, one hundred one million, two hundred ten thousand, nine hundred eighty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.076 sec. • engine limits •