Base | Representation |
---|---|
bin | 10110111111010110001000… |
… | …110110111010010101001100 |
3 | 111021000000220012020002122222 |
4 | 112333112020312322111030 |
5 | 101223042012012224322 |
6 | 555013203132554512 |
7 | 30203652026556221 |
oct | 2677261066722514 |
9 | 437000805202588 |
10 | 101110121211212 |
11 | 2a24261a540a33 |
12 | b40b99b022a38 |
13 | 4455849a6a999 |
14 | 1ad7a82591948 |
15 | ba518dac2e42 |
hex | 5bf588dba54c |
101110121211212 has 24 divisors (see below), whose sum is σ = 177005830667232. Its totient is φ = 50537027923200.
The previous prime is 101110121211199. The next prime is 101110121211217. The reversal of 101110121211212 is 212112121011101.
It is a super-2 number, since 2×1011101212112122 (a number of 29 digits) contains 22 as substring.
It is not an unprimeable number, because it can be changed into a prime (101110121211217) by changing a digit.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 384038537 + ... + 384301727.
It is an arithmetic number, because the mean of its divisors is an integer number (7375242944468).
Almost surely, 2101110121211212 is an apocalyptic number.
It is an amenable number.
101110121211212 is a deficient number, since it is larger than the sum of its proper divisors (75895709456020).
101110121211212 is a wasteful number, since it uses less digits than its factorization.
101110121211212 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 297089 (or 297087 counting only the distinct ones).
The product of its (nonzero) digits is 16, while the sum is 17.
Adding to 101110121211212 its reverse (212112121011101), we get a palindrome (313222242222313).
It can be divided in two parts, 1011101 and 21211212, that multiplied together give a palindrome (21446677664412).
The spelling of 101110121211212 in words is "one hundred one trillion, one hundred ten billion, one hundred twenty-one million, two hundred eleven thousand, two hundred twelve".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.087 sec. • engine limits •