Base | Representation |
---|---|
bin | 111000100010000010… |
… | …0111110111001111100 |
3 | 102121100122212001002010 |
4 | 1301010010332321330 |
5 | 3442112204204322 |
6 | 131434305531220 |
7 | 11525302344516 |
oct | 1610404767174 |
9 | 377318761063 |
10 | 121401241212 |
11 | 47538921409 |
12 | 1b641043b10 |
13 | b5a95aba94 |
14 | 5c3949cbb6 |
15 | 3257ee320c |
hex | 1c4413ee7c |
121401241212 has 12 divisors (see below), whose sum is σ = 283269562856. Its totient is φ = 40467080400.
The previous prime is 121401241189. The next prime is 121401241223. The reversal of 121401241212 is 212142104121.
It is a tau number, because it is divible by the number of its divisors (12).
It is a super-2 number, since 2×1214012412122 (a number of 23 digits) contains 22 as substring.
It is a congruent number.
It is an unprimeable number.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 5058385039 + ... + 5058385062.
Almost surely, 2121401241212 is an apocalyptic number.
121401241212 is a gapful number since it is divisible by the number (12) formed by its first and last digit.
It is an amenable number.
121401241212 is an abundant number, since it is smaller than the sum of its proper divisors (161868321644).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
121401241212 is a wasteful number, since it uses less digits than its factorization.
121401241212 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 10116770108 (or 10116770106 counting only the distinct ones).
The product of its (nonzero) digits is 256, while the sum is 21.
Adding to 121401241212 its reverse (212142104121), we get a palindrome (333543345333).
The spelling of 121401241212 in words is "one hundred twenty-one billion, four hundred one million, two hundred forty-one thousand, two hundred twelve".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •