Base | Representation |
---|---|
bin | 10111000000101100111111… |
… | …011000110101110101010101 |
3 | 111021022221121102002022211102 |
4 | 113000230333120311311111 |
5 | 101231104004213402323 |
6 | 555124105010515445 |
7 | 30213463022242241 |
oct | 2700547730656525 |
9 | 437287542068742 |
10 | 101203377872213 |
11 | 2a2791254956a1 |
12 | b425a86595b85 |
13 | 446158c4a99b6 |
14 | 1adc3abbc7421 |
15 | ba77eace1328 |
hex | 5c0b3f635d55 |
101203377872213 has 4 divisors (see below), whose sum is σ = 101204276316780. Its totient is φ = 101202479427648.
The previous prime is 101203377872197. The next prime is 101203377872221. The reversal of 101203377872213 is 312278773302101.
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 64737745884529 + 36465631987684 = 8045977^2 + 6038678^2 .
It is a cyclic number.
It is not a de Polignac number, because 101203377872213 - 24 = 101203377872197 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 (101203377877213) 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, 449053298 + ... + 449278611.
It is an arithmetic number, because the mean of its divisors is an integer number (25301069079195).
Almost surely, 2101203377872213 is an apocalyptic number.
It is an amenable number.
101203377872213 is a deficient number, since it is larger than the sum of its proper divisors (898444567).
101203377872213 is an equidigital number, since it uses as much as digits as its factorization.
101203377872213 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 898444566.
The product of its (nonzero) digits is 592704, while the sum is 47.
The spelling of 101203377872213 in words is "one hundred one trillion, two hundred three billion, three hundred seventy-seven million, eight hundred seventy-two thousand, two hundred thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.086 sec. • engine limits •