Base | Representation |
---|---|
bin | 10111000000101010110010… |
… | …110110101100110101001010 |
3 | 111021022201112002112201010120 |
4 | 113000222302312230311022 |
5 | 101231034142122042302 |
6 | 555123035023524110 |
7 | 30213350422513323 |
oct | 2700526266546512 |
9 | 437281462481116 |
10 | 101201020112202 |
11 | 2a2781256036aa |
12 | b425528a59636 |
13 | 44612a4b9032a |
14 | 1adc226a0144a |
15 | ba770dd109bc |
hex | 5c0ab2dacd4a |
101201020112202 has 8 divisors (see below), whose sum is σ = 202402040224416. Its totient is φ = 33733673370732.
The previous prime is 101201020112189. The next prime is 101201020112209. The reversal of 101201020112202 is 202211020102101.
It is a sphenic number, since it is the product of 3 distinct primes.
101201020112202 is an admirable number.
It is not an unprimeable number, because it can be changed into a prime (101201020112209) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (23) of ones.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 8433418342678 + ... + 8433418342689.
It is an arithmetic number, because the mean of its divisors is an integer number (25300255028052).
Almost surely, 2101201020112202 is an apocalyptic number.
101201020112202 is a primitive abundant number, since it is smaller than the sum of its proper divisors, none of which is abundant.
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
101201020112202 is a wasteful number, since it uses less digits than its factorization.
101201020112202 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 16866836685372.
The product of its (nonzero) digits is 32, while the sum is 15.
Adding to 101201020112202 its reverse (202211020102101), we get a palindrome (303412040214303).
The spelling of 101201020112202 in words is "one hundred one trillion, two hundred one billion, twenty million, one hundred twelve thousand, two hundred two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.075 sec. • engine limits •