Base | Representation |
---|---|
bin | 11011100000111101001101… |
… | …011001100001001111110100 |
3 | 120212110122010111021022201120 |
4 | 123200331031121201033310 |
5 | 111330130040014201322 |
6 | 1105212051334023540 |
7 | 34326554136125046 |
oct | 3340751531411764 |
9 | 525418114238646 |
10 | 121012002100212 |
11 | 356159a1455693 |
12 | 116a4b2a7a7bb0 |
13 | 526a4c9113c52 |
14 | 21c50254bda96 |
15 | decbee904a5c |
hex | 6e0f4d6613f4 |
121012002100212 has 24 divisors (see below), whose sum is σ = 292097936104800. Its totient is φ = 38946391480416.
The previous prime is 121012002100201. The next prime is 121012002100361. The reversal of 121012002100212 is 212001200210121.
It is a junction number, because it is equal to n+sod(n) for n = 121012002100191 and 121012002100200.
It is a congruent number.
It is an unprimeable number.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 173867818762 + ... + 173867819457.
It is an arithmetic number, because the mean of its divisors is an integer number (12170747337700).
Almost surely, 2121012002100212 is an apocalyptic number.
121012002100212 is a gapful number since it is divisible by the number (12) formed by its first and last digit.
It is an amenable number.
121012002100212 is an abundant number, since it is smaller than the sum of its proper divisors (171085934004588).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
121012002100212 is a wasteful number, since it uses less digits than its factorization.
121012002100212 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 347735638255 (or 347735638253 counting only the distinct ones).
The product of its (nonzero) digits is 32, while the sum is 15.
Adding to 121012002100212 its reverse (212001200210121), we get a palindrome (333013202310333).
The spelling of 121012002100212 in words is "one hundred twenty-one trillion, twelve billion, two million, one hundred thousand, two hundred twelve".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.088 sec. • engine limits •