Base | Representation |
---|---|
bin | 101111000111111111… |
… | …1011100011011011100 |
3 | 100200012210200201212210 |
4 | 1132033333130123130 |
5 | 3124224201134322 |
6 | 114253551400420 |
7 | 10211554662423 |
oct | 1361777343334 |
9 | 320183621783 |
10 | 101200021212 |
11 | 39a11856874 |
12 | 17743823110 |
13 | 970a310774 |
14 | 4c805982ba |
15 | 297477b70c |
hex | 178ffdc6dc |
101200021212 has 48 divisors (see below), whose sum is σ = 239053328640. Its totient is φ = 33316460928.
The previous prime is 101200021211. The next prime is 101200021277. The reversal of 101200021212 is 212120002101.
It is a super-3 number, since 3×1012000212123 (a number of 34 digits) contains 333 as substring.
It is a Harshad number since it is a multiple of its sum of digits (12).
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (101200021211) by changing a digit.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 3564489 + ... + 3592767.
It is an arithmetic number, because the mean of its divisors is an integer number (4980277680).
Almost surely, 2101200021212 is an apocalyptic number.
101200021212 is a gapful number since it is divisible by the number (12) formed by its first and last digit.
It is an amenable number.
101200021212 is an abundant number, since it is smaller than the sum of its proper divisors (137853307428).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
101200021212 is a wasteful number, since it uses less digits than its factorization.
101200021212 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 31962 (or 31960 counting only the distinct ones).
The product of its (nonzero) digits is 16, while the sum is 12.
Adding to 101200021212 its reverse (212120002101), we get a palindrome (313320023313).
The spelling of 101200021212 in words is "one hundred one billion, two hundred million, twenty-one thousand, two hundred twelve".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.075 sec. • engine limits •