Base | Representation |
---|---|
bin | 11011100011110111011111… |
… | …100001010001011111110000 |
3 | 120220011202102020012012111221 |
4 | 123203313133201101133300 |
5 | 111341414210124231000 |
6 | 1105444011220514424 |
7 | 34350164622106234 |
oct | 3343673741213760 |
9 | 526152366165457 |
10 | 121212022102000 |
11 | 35692803538495 |
12 | 11717850b4ba14 |
13 | 52833246172ab |
14 | 21d099c0ca5c4 |
15 | e030099ca61a |
hex | 6e3ddf8517f0 |
121212022102000 has 40 divisors (see below), whose sum is σ = 293090669447472. Its totient is φ = 48484808840000.
The previous prime is 121212022101997. The next prime is 121212022102091. The reversal of 121212022102000 is 201220212121.
It is a happy number.
It is a tau number, because it is divible by the number of its divisors (40).
It is a Harshad number since it is a multiple of its sum of digits (16).
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, 30303003526 + ... + 30303007525.
Almost surely, 2121212022102000 is an apocalyptic number.
121212022102000 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
It is an amenable number.
121212022102000 is an abundant number, since it is smaller than the sum of its proper divisors (171878647345472).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
121212022102000 is an equidigital number, since it uses as much as digits as its factorization.
121212022102000 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 60606011074 (or 60606011058 counting only the distinct ones).
The product of its (nonzero) digits is 64, while the sum is 16.
Adding to 121212022102000 its reverse (201220212121), we get a palindrome (121413242314121).
The spelling of 121212022102000 in words is "one hundred twenty-one trillion, two hundred twelve billion, twenty-two million, one hundred two thousand".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.065 sec. • engine limits •