Base | Representation |
---|---|
bin | 10110111111010100000010… |
… | …110101010101101011111001 |
3 | 111020222211002111011110100002 |
4 | 112333110002311111223321 |
5 | 101223022410344331100 |
6 | 555012152050322345 |
7 | 30203542224253121 |
oct | 2677240265255371 |
9 | 436884074143302 |
10 | 101107872652025 |
11 | 2a241676265158 |
12 | b40b471b893b5 |
13 | 445557bc669a5 |
14 | 1ad790bab3c81 |
15 | ba50ab4b32d5 |
hex | 5bf502d55af9 |
101107872652025 has 12 divisors (see below), whose sum is σ = 125374257859452. Its totient is φ = 80885978269440.
The previous prime is 101107872652021. The next prime is 101107872652027. The reversal of 101107872652025 is 520256278701101.
It is a happy number.
It can be written as a sum of positive squares in 6 ways, for example, as 17711909936704 + 83395962715321 = 4208552^2 + 9132139^2 .
It is not a de Polignac number, because 101107872652025 - 22 = 101107872652021 is a prime.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (101107872652021) by changing a digit.
It is a polite number, since it can be written in 11 ways as a sum of consecutive naturals, for example, 1442372 + ... + 14293221.
It is an arithmetic number, because the mean of its divisors is an integer number (10447854821621).
Almost surely, 2101107872652025 is an apocalyptic number.
It is an amenable number.
101107872652025 is a deficient number, since it is larger than the sum of its proper divisors (24266385207427).
101107872652025 is a wasteful number, since it uses less digits than its factorization.
101107872652025 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 15992620 (or 15992615 counting only the distinct ones).
The product of its (nonzero) digits is 470400, while the sum is 47.
The spelling of 101107872652025 in words is "one hundred one trillion, one hundred seven billion, eight hundred seventy-two million, six hundred fifty-two thousand, twenty-five".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.080 sec. • engine limits •