Base | Representation |
---|---|
bin | 10111001110000011101101… |
… | …001001011101011111110000 |
3 | 111101120200110111220021112211 |
4 | 113032003231021131133300 |
5 | 101341123024001010000 |
6 | 1001105443445301504 |
7 | 30340002403120066 |
oct | 2716035511353760 |
9 | 441520414807484 |
10 | 102121121110000 |
11 | 2a5a2362635673 |
12 | b553910a04894 |
13 | 44c9c98c26a75 |
14 | 1b3098d880036 |
15 | bc1610da87ba |
hex | 5ce0ed25d7f0 |
102121121110000 has 50 divisors (see below), whose sum is σ = 247245446343632. Its totient is φ = 40848448440000.
The previous prime is 102121121109991. The next prime is 102121121110069. The reversal of 102121121110000 is 11121121201.
It is a happy number.
It is a tau number, because it is divible by the number of its divisors (50).
It is a congruent number.
It is an unprimeable number.
It is a polite number, since it can be written in 9 ways as a sum of consecutive naturals, for example, 5106046056 + ... + 5106066055.
Almost surely, 2102121121110000 is an apocalyptic number.
102121121110000 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
It is an amenable number.
102121121110000 is an abundant number, since it is smaller than the sum of its proper divisors (145124325233632).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
102121121110000 is an equidigital number, since it uses as much as digits as its factorization.
102121121110000 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 10212112139 (or 10212112118 counting only the distinct ones).
The product of its (nonzero) digits is 8, while the sum is 13.
Adding to 102121121110000 its reverse (11121121201), we get a palindrome (102132242231201).
It can be divided in two parts, 102121 and 121110000, that added together give a palindrome (121212121).
The spelling of 102121121110000 in words is "one hundred two trillion, one hundred twenty-one billion, one hundred twenty-one million, one hundred ten thousand".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.074 sec. • engine limits •