Base | Representation |
---|---|
bin | 101101110000000001011110… |
… | …010100000011111100001011 |
3 | 222101102200212212222121112202 |
4 | 231300001132110003330023 |
5 | 202333130101302402311 |
6 | 1551535340245030415 |
7 | 60245050100104331 |
oct | 5560013624037413 |
9 | 871380785877482 |
10 | 201212210200331 |
11 | 5912668a0806a0 |
12 | 1a6983360b540b |
13 | 88372cb4274a5 |
14 | 3798a19a45b51 |
15 | 183ded0bbbe3b |
hex | b7005e503f0b |
201212210200331 has 4 divisors (see below), whose sum is σ = 219504229309464. Its totient is φ = 182920191091200.
The previous prime is 201212210200319. The next prime is 201212210200333. The reversal of 201212210200331 is 133002012212102.
It is a semiprime because it is the product of two primes.
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-201212210200331 is a prime.
It is a super-2 number, since 2×2012122102003312 (a number of 29 digits) contains 22 as substring.
It is not an unprimeable number, because it can be changed into a prime (201212210200333) 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, 9146009554550 + ... + 9146009554571.
It is an arithmetic number, because the mean of its divisors is an integer number (54876057327366).
Almost surely, 2201212210200331 is an apocalyptic number.
201212210200331 is a deficient number, since it is larger than the sum of its proper divisors (18292019109133).
201212210200331 is a wasteful number, since it uses less digits than its factorization.
201212210200331 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 18292019109132.
The product of its (nonzero) digits is 288, while the sum is 20.
Adding to 201212210200331 its reverse (133002012212102), we get a palindrome (334214222412433).
The spelling of 201212210200331 in words is "two hundred one trillion, two hundred twelve billion, two hundred ten million, two hundred thousand, three hundred thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.092 sec. • engine limits •