Base | Representation |
---|---|
bin | 11011100010011010011100… |
… | …010111011110001011001100 |
3 | 120212211012112021020002010102 |
4 | 123202122130113132023030 |
5 | 111333300100432224322 |
6 | 1105330045155430232 |
7 | 34340030006413322 |
oct | 3342323427361314 |
9 | 525735467202112 |
10 | 121112111211212 |
11 | 356543a3435470 |
12 | 11700408bb5378 |
13 | 5276a914071c4 |
14 | 21c9c00c23d12 |
15 | e0060d4e3792 |
hex | 6e269c5de2cc |
121112111211212 has 48 divisors (see below), whose sum is σ = 231980850245760. Its totient is φ = 54868404672000.
The previous prime is 121112111211197. The next prime is 121112111211257. The reversal of 121112111211212 is 212112111211121.
121112111211212 is digitally balanced in base 3, because in such base it contains all the possibile digits an equal number of times.
It is a nude number because it is divisible by every one of its digits.
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, 236661212 + ... + 237172412.
It is an arithmetic number, because the mean of its divisors is an integer number (4832934380120).
Almost surely, 2121112111211212 is an apocalyptic number.
It is an amenable number.
121112111211212 is a deficient number, since it is larger than the sum of its proper divisors (110868739034548).
121112111211212 is a wasteful number, since it uses less digits than its factorization.
121112111211212 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 529062 (or 529060 counting only the distinct ones).
The product of its digits is 32, while the sum is 20.
Adding to 121112111211212 its reverse (212112111211121), we get a palindrome (333224222422333).
Subtracting 121112111211212 from its reverse (212112111211121), we obtain a palindrome (90999999999909).
The spelling of 121112111211212 in words is "one hundred twenty-one trillion, one hundred twelve billion, one hundred eleven million, two hundred eleven thousand, two hundred twelve".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.080 sec. • engine limits •