Base | Representation |
---|---|
bin | 101101110000000010100001… |
… | …001000011000001100101011 |
3 | 222101102210210000100212011022 |
4 | 231300002201020120030223 |
5 | 202333134400242223201 |
6 | 1551540043412123055 |
7 | 60245116631406215 |
oct | 5560024110301453 |
9 | 871383700325138 |
10 | 201213331211051 |
11 | 59127104936635 |
12 | 1a6985a960648b |
13 | 8837449753643 |
14 | 3798ac48935b5 |
15 | 183e04930341b |
hex | b700a121832b |
201213331211051 has 2 divisors, whose sum is σ = 201213331211052. Its totient is φ = 201213331211050.
The previous prime is 201213331211003. The next prime is 201213331211083. The reversal of 201213331211051 is 150112133312102.
It is a happy number.
It is a strong prime.
It is a cyclic number.
It is not a de Polignac number, because 201213331211051 - 26 = 201213331210987 is a prime.
It is a super-2 number, since 2×2012133312110512 (a number of 29 digits) contains 22 as substring.
It is a self number, because there is not a number n which added to its sum of digits gives 201213331211051.
It is not a weakly prime, because it can be changed into another prime (201213331211951) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 100606665605525 + 100606665605526.
It is an arithmetic number, because the mean of its divisors is an integer number (100606665605526).
Almost surely, 2201213331211051 is an apocalyptic number.
201213331211051 is a deficient number, since it is larger than the sum of its proper divisors (1).
201213331211051 is an equidigital number, since it uses as much as digits as its factorization.
201213331211051 is an evil number, because the sum of its binary digits is even.
The product of its (nonzero) digits is 1080, while the sum is 26.
Adding to 201213331211051 its reverse (150112133312102), we get a palindrome (351325464523153).
The spelling of 201213331211051 in words is "two hundred one trillion, two hundred thirteen billion, three hundred thirty-one million, two hundred eleven thousand, fifty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •