Base | Representation |
---|---|
bin | 1001100110001011011001… |
… | …11001000001010011100011 |
3 | 2202201102112102211122110100 |
4 | 10303011230321001103203 |
5 | 10231222421302242011 |
6 | 112514330202033443 |
7 | 4305433020441006 |
oct | 463055471012343 |
9 | 82642472748410 |
10 | 21103001212131 |
11 | 67a6807037133 |
12 | 2449aa04a8883 |
13 | ba1009aa9177 |
14 | 52d56816553d |
15 | 268e0e069d56 |
hex | 13316ce414e3 |
21103001212131 has 12 divisors (see below), whose sum is σ = 30641705078400. Its totient is φ = 13995009528720.
The previous prime is 21103001212127. The next prime is 21103001212141. The reversal of 21103001212131 is 13121210030112.
21103001212131 is a `hidden beast` number, since 2 + 110 + 300 + 121 + 2 + 131 = 666.
It is not a de Polignac number, because 21103001212131 - 22 = 21103001212127 is a prime.
It is a super-2 number, since 2×211030012121312 (a number of 27 digits) contains 22 as substring.
It is not an unprimeable number, because it can be changed into a prime (21103001212141) by changing a digit.
It is a polite number, since it can be written in 11 ways as a sum of consecutive naturals, for example, 6138160356 + ... + 6138163793.
It is an arithmetic number, because the mean of its divisors is an integer number (2553475423200).
Almost surely, 221103001212131 is an apocalyptic number.
21103001212131 is a deficient number, since it is larger than the sum of its proper divisors (9538703866269).
21103001212131 is a wasteful number, since it uses less digits than its factorization.
21103001212131 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 12276324346 (or 12276324343 counting only the distinct ones).
The product of its (nonzero) digits is 72, while the sum is 18.
Adding to 21103001212131 its reverse (13121210030112), we get a palindrome (34224211242243).
The spelling of 21103001212131 in words is "twenty-one trillion, one hundred three billion, one million, two hundred twelve thousand, one hundred thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.077 sec. • engine limits •