Base | Representation |
---|---|
bin | 101101110000010010111110… |
… | …010110000101100010110111 |
3 | 222101111111101110120222010001 |
4 | 231300102332112011202313 |
5 | 202333432042302304421 |
6 | 1551552125025412131 |
7 | 60246313542062212 |
oct | 5560227626054267 |
9 | 871444343528101 |
10 | 201231001213111 |
11 | 59133652115721 |
12 | 1a69babb19a047 |
13 | 88390044b206c |
14 | 37998bd53c779 |
15 | 183e730724691 |
hex | b704be5858b7 |
201231001213111 has 4 divisors (see below), whose sum is σ = 201231030442000. Its totient is φ = 201230971984224.
The previous prime is 201231001213093. The next prime is 201231001213163. The reversal of 201231001213111 is 111312100132102.
It is a semiprime because it is the product of two primes, and also a brilliant number, because the two primes have the same length.
It is a cyclic number.
It is not a de Polignac number, because 201231001213111 - 29 = 201231001212599 is a prime.
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (201231001013111) by changing a digit.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 2035630 + ... + 20164468.
It is an arithmetic number, because the mean of its divisors is an integer number (50307757610500).
Almost surely, 2201231001213111 is an apocalyptic number.
201231001213111 is a deficient number, since it is larger than the sum of its proper divisors (29228889).
201231001213111 is a wasteful number, since it uses less digits than its factorization.
201231001213111 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 29228888.
The product of its (nonzero) digits is 72, while the sum is 19.
Adding to 201231001213111 its reverse (111312100132102), we get a palindrome (312543101345213).
The spelling of 201231001213111 in words is "two hundred one trillion, two hundred thirty-one billion, one million, two hundred thirteen thousand, one hundred eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.141 sec. • engine limits •