Base | Representation |
---|---|
bin | 101101110000000001011000… |
… | …011010000110101001110010 |
3 | 222101102200121222112212021021 |
4 | 231300001120122012221302 |
5 | 202333124400421333020 |
6 | 1551535322345250054 |
7 | 60245044454665333 |
oct | 5560013032065162 |
9 | 871380558485237 |
10 | 201212111121010 |
11 | 59126639158960 |
12 | 1a698308a9392a |
13 | 88372b3a46a82 |
14 | 3798a0a81428a |
15 | 183dec714a1aa |
hex | b70058686a72 |
201212111121010 has 64 divisors (see below), whose sum is σ = 422491101047424. Its totient is φ = 68182215808000.
The previous prime is 201212111121001. The next prime is 201212111121011. The reversal of 201212111121010 is 10121111212102.
It is a super-2 number, since 2×2012121111210102 (a number of 29 digits) contains 22 as substring.
It is not an unprimeable number, because it can be changed into a prime (201212111121011) 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, 532484692 + ... + 532862431.
It is an arithmetic number, because the mean of its divisors is an integer number (6601423453866).
Almost surely, 2201212111121010 is an apocalyptic number.
201212111121010 is an abundant number, since it is smaller than the sum of its proper divisors (221278989926414).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
201212111121010 is a wasteful number, since it uses less digits than its factorization.
201212111121010 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 1065347259.
The product of its (nonzero) digits is 16, while the sum is 16.
Adding to 201212111121010 its reverse (10121111212102), we get a palindrome (211333222333112).
It can be divided in two parts, 2012121 and 11121010, that added together give a palindrome (13133131).
The spelling of 201212111121010 in words is "two hundred one trillion, two hundred twelve billion, one hundred eleven million, one hundred twenty-one thousand, ten".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •