Base | Representation |
---|---|
bin | 10111001100011101010101… |
… | …010101110010001011011100 |
3 | 111101012011201220222102000020 |
4 | 113030131111111302023130 |
5 | 101332322414201134322 |
6 | 1000543144235032140 |
7 | 30326031430226346 |
oct | 2714352525621334 |
9 | 441164656872006 |
10 | 102011200021212 |
11 | 2a55a785a92739 |
12 | b53655459b650 |
13 | 44bc7cbb987b1 |
14 | 1b29522d5c296 |
15 | bbd82ab9c05c |
hex | 5cc7555722dc |
102011200021212 has 48 divisors (see below), whose sum is σ = 245705734321152. Its totient is φ = 32906659443840.
The previous prime is 102011200021201. The next prime is 102011200021229. The reversal of 102011200021212 is 212120002110201.
It is a junction number, because it is equal to n+sod(n) for n = 102011200021191 and 102011200021200.
It is a congruent number.
It is an unprimeable number.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 79078663 + ... + 80358305.
It is an arithmetic number, because the mean of its divisors is an integer number (5118869465024).
Almost surely, 2102011200021212 is an apocalyptic number.
102011200021212 is a gapful number since it is divisible by the number (12) formed by its first and last digit.
It is an amenable number.
102011200021212 is an abundant number, since it is smaller than the sum of its proper divisors (143694534299940).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
102011200021212 is a wasteful number, since it uses less digits than its factorization.
102011200021212 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1493978 (or 1493976 counting only the distinct ones).
The product of its (nonzero) digits is 32, while the sum is 15.
Adding to 102011200021212 its reverse (212120002110201), we get a palindrome (314131202131413).
The spelling of 102011200021212 in words is "one hundred two trillion, eleven billion, two hundred million, twenty-one thousand, two hundred twelve".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.090 sec. • engine limits •