Base | Representation |
---|---|
bin | 11011100010001111010001… |
… | …000111000100001110111100 |
3 | 120212210001112222002102001121 |
4 | 123202033101013010032330 |
5 | 111333101011431414322 |
6 | 1105320342325520324 |
7 | 34336123435125403 |
oct | 3342172107041674 |
9 | 525701488072047 |
10 | 121100111201212 |
11 | 3564a2a5777330 |
12 | 116ba01a2730a4 |
13 | 52758cb26ac80 |
14 | 21c93c320263a |
15 | e00159c6eec7 |
hex | 6e23d11c43bc |
121100111201212 has 48 divisors (see below), whose sum is σ = 250350606795744. Its totient is φ = 50530510368000.
The previous prime is 121100111201203. The next prime is 121100111201219. The reversal of 121100111201212 is 212102111001121.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (121100111201219) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (23) of ones.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 584740339 + ... + 584947402.
It is an arithmetic number, because the mean of its divisors is an integer number (5215637641578).
Almost surely, 2121100111201212 is an apocalyptic number.
It is an amenable number.
121100111201212 is an abundant number, since it is smaller than the sum of its proper divisors (129250495594532).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
121100111201212 is a wasteful number, since it uses less digits than its factorization.
121100111201212 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1169687950 (or 1169687948 counting only the distinct ones).
The product of its (nonzero) digits is 16, while the sum is 16.
Adding to 121100111201212 its reverse (212102111001121), we get a palindrome (333202222202333).
The spelling of 121100111201212 in words is "one hundred twenty-one trillion, one hundred billion, one hundred eleven million, two hundred one thousand, two hundred twelve".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.085 sec. • engine limits •