Base | Representation |
---|---|
bin | 11101110010010100010010… |
… | …000011001011110100010101 |
3 | 122011211120201220212202120020 |
4 | 131302110102003023310111 |
5 | 114132310223140220041 |
6 | 1142341024044055353 |
7 | 36410342250055551 |
oct | 3562242203136425 |
9 | 564746656782506 |
10 | 131001100320021 |
11 | 38817288a36908 |
12 | 12838a83534559 |
13 | 58134737b4259 |
14 | 244c6b67c8861 |
15 | 102298c70a866 |
hex | 7725120cbd15 |
131001100320021 has 16 divisors (see below), whose sum is σ = 174758922733248. Its totient is φ = 87288683753600.
The previous prime is 131001100320011. The next prime is 131001100320073. The reversal of 131001100320021 is 120023001100131.
It is a happy number.
It is a cyclic number.
It is not a de Polignac number, because 131001100320021 - 210 = 131001100318997 is a prime.
It is a super-2 number, since 2×1310011003200212 (a number of 29 digits) contains 22 as substring.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (131001100320001) 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, 44840761 + ... + 47672801.
It is an arithmetic number, because the mean of its divisors is an integer number (10922432670828).
Almost surely, 2131001100320021 is an apocalyptic number.
It is an amenable number.
131001100320021 is a deficient number, since it is larger than the sum of its proper divisors (43757822413227).
131001100320021 is a wasteful number, since it uses less digits than its factorization.
131001100320021 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 2840052.
The product of its (nonzero) digits is 36, while the sum is 15.
Adding to 131001100320021 its reverse (120023001100131), we get a palindrome (251024101420152).
The spelling of 131001100320021 in words is "one hundred thirty-one trillion, one billion, one hundred million, three hundred twenty thousand, twenty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •