Base | Representation |
---|---|
bin | 1001100100000101101011… |
… | …10011101010110101110101 |
3 | 2202110120020012012101120102 |
4 | 10302002311303222311311 |
5 | 10224033404241232013 |
6 | 112421334325243445 |
7 | 4300311664201220 |
oct | 462026563526565 |
9 | 82416205171512 |
10 | 21031210102133 |
11 | 6779316902670 |
12 | 2437ba5863585 |
13 | b9730856501a |
14 | 529cb770c5b7 |
15 | 26710b5a9d58 |
hex | 1320b5cead75 |
21031210102133 has 16 divisors (see below), whose sum is σ = 26333264820096. Its totient is φ = 16317621335040.
The previous prime is 21031210102069. The next prime is 21031210102141. The reversal of 21031210102133 is 33120101213012.
It is a happy number.
It is a cyclic number.
It is not a de Polignac number, because 21031210102133 - 26 = 21031210102069 is a prime.
It is a super-2 number, since 2×210312101021332 (a number of 27 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 (21031210102333) by changing a digit.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 586103516 + ... + 586139397.
It is an arithmetic number, because the mean of its divisors is an integer number (1645829051256).
Almost surely, 221031210102133 is an apocalyptic number.
It is an amenable number.
21031210102133 is a deficient number, since it is larger than the sum of its proper divisors (5302054717963).
21031210102133 is a wasteful number, since it uses less digits than its factorization.
21031210102133 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 1172243164.
The product of its (nonzero) digits is 216, while the sum is 20.
Adding to 21031210102133 its reverse (33120101213012), we get a palindrome (54151311315145).
The spelling of 21031210102133 in words is "twenty-one trillion, thirty-one billion, two hundred ten million, one hundred two thousand, one hundred thirty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.076 sec. • engine limits •