Base | Representation |
---|---|
bin | 10111000000101011000101… |
… | …011100011110000100100101 |
3 | 111021022202022211102102000122 |
4 | 113000223011130132010211 |
5 | 101231040311443044414 |
6 | 555123130004451325 |
7 | 30213361230526262 |
oct | 2700530534360445 |
9 | 437282284372018 |
10 | 101201332003109 |
11 | 2a278275669988 |
12 | b4255b53a9b45 |
13 | 4461324692570 |
14 | 1adc2561cc269 |
15 | ba772b3bcb8e |
hex | 5c0ac571e125 |
101201332003109 has 4 divisors (see below), whose sum is σ = 108986049849516. Its totient is φ = 93416614156704.
The previous prime is 101201332003097. The next prime is 101201332003171. The reversal of 101201332003109 is 901300233102101.
It is a semiprime because it is the product of two primes.
It can be written as a sum of positive squares in 2 ways, for example, as 38500510994884 + 62700821008225 = 6204878^2 + 7918385^2 .
It is a cyclic number.
It is not a de Polignac number, because 101201332003109 - 236 = 101132612526373 is a prime.
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (101201332006109) by changing a digit.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 3892358923184 + ... + 3892358923209.
It is an arithmetic number, because the mean of its divisors is an integer number (27246512462379).
Almost surely, 2101201332003109 is an apocalyptic number.
It is an amenable number.
101201332003109 is a deficient number, since it is larger than the sum of its proper divisors (7784717846407).
101201332003109 is an equidigital number, since it uses as much as digits as its factorization.
101201332003109 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 7784717846406.
The product of its (nonzero) digits is 972, while the sum is 26.
The spelling of 101201332003109 in words is "one hundred one trillion, two hundred one billion, three hundred thirty-two million, three thousand, one hundred nine".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.077 sec. • engine limits •