Base | Representation |
---|---|
bin | 101101110000010010111110… |
… | …011001100011011110010011 |
3 | 222101111111101112022011001110 |
4 | 231300102332121203132103 |
5 | 202333432043020402011 |
6 | 1551552125101104403 |
7 | 60246313552566342 |
oct | 5560227631433623 |
9 | 871444345264043 |
10 | 201231002122131 |
11 | 59133652686683 |
12 | 1a69babb558103 |
13 | 883900473ca47 |
14 | 37998bd6d7b59 |
15 | 183e730853ba6 |
hex | b704be663793 |
201231002122131 has 32 divisors (see below), whose sum is σ = 298650839316480. Its totient is φ = 119993640710400.
The previous prime is 201231002121949. The next prime is 201231002122141. The reversal of 201231002122131 is 131221200132102.
It is not a de Polignac number, because 201231002122131 - 221 = 201231000024979 is a prime.
It is a super-2 number, since 2×2012310021221312 (a number of 29 digits) contains 22 as substring.
It is a junction number, because it is equal to n+sod(n) for n = 201231002122098 and 201231002122107.
It is not an unprimeable number, because it can be changed into a prime (201231002122141) by changing a digit.
It is a polite number, since it can be written in 31 ways as a sum of consecutive naturals, for example, 1388742840 + ... + 1388887733.
It is an arithmetic number, because the mean of its divisors is an integer number (9332838728640).
Almost surely, 2201231002122131 is an apocalyptic number.
201231002122131 is a deficient number, since it is larger than the sum of its proper divisors (97419837194349).
201231002122131 is a wasteful number, since it uses less digits than its factorization.
201231002122131 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 2777630667.
The product of its (nonzero) digits is 288, while the sum is 21.
Adding to 201231002122131 its reverse (131221200132102), we get a palindrome (332452202254233).
The spelling of 201231002122131 in words is "two hundred one trillion, two hundred thirty-one billion, two million, one hundred twenty-two thousand, one hundred thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.084 sec. • engine limits •