Base | Representation |
---|---|
bin | 101101110000000000100010… |
… | …000110111010100010101000 |
3 | 222101102121021111100021012011 |
4 | 231300000202012322202220 |
5 | 202333121014212333000 |
6 | 1551535052123325304 |
7 | 60245013053423536 |
oct | 5560004206724250 |
9 | 871377244307164 |
10 | 201211200121000 |
11 | 591262109a3093 |
12 | 1a6980b3980834 |
13 | 883719a09b604 |
14 | 3798961833156 |
15 | 183de721992ba |
hex | b700221ba8a8 |
201211200121000 has 64 divisors (see below), whose sum is σ = 470839703564880. Its totient is φ = 80483540684800.
The previous prime is 201211200120949. The next prime is 201211200121027. The reversal of 201211200121000 is 121002112102.
It can be written as a sum of positive squares in 8 ways, for example, as 2784366124164 + 198426833996836 = 1668642^2 + 14086406^2 .
It is a super-2 number, since 2×2012112001210002 (a number of 29 digits) contains 22 as substring.
It is an unprimeable number.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 87927324 + ... + 90186676.
Almost surely, 2201211200121000 is an apocalyptic number.
201211200121000 is a gapful number since it is divisible by the number (20) formed by its first and last digit.
It is an amenable number.
201211200121000 is an abundant number, since it is smaller than the sum of its proper divisors (269628503443880).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
201211200121000 is a wasteful number, since it uses less digits than its factorization.
201211200121000 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 2348431 (or 2348417 counting only the distinct ones).
The product of its (nonzero) digits is 16, while the sum is 13.
Adding to 201211200121000 its reverse (121002112102), we get a palindrome (201332202233102).
The spelling of 201211200121000 in words is "two hundred one trillion, two hundred eleven billion, two hundred million, one hundred twenty-one thousand".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.084 sec. • engine limits •