Base | Representation |
---|---|
bin | 11000001010111010100111… |
… | …101110110100100111101001 |
3 | 111221101111021120222012211210 |
4 | 120022322213232310213221 |
5 | 102413133031142121400 |
6 | 1014031012505143333 |
7 | 31251104514461511 |
oct | 3012724756644751 |
9 | 457344246865753 |
10 | 106303254645225 |
11 | 30964a58a21a70 |
12 | bb0a348a8ab49 |
13 | 474147a696a01 |
14 | 1c371680b4841 |
15 | c452d1a0a950 |
hex | 60aea7bb49e9 |
106303254645225 has 72 divisors (see below), whose sum is σ = 198571861024992. Its totient is φ = 49763696729600.
The previous prime is 106303254645223. The next prime is 106303254645253. The reversal of 106303254645225 is 522546452303601.
It is not a de Polignac number, because 106303254645225 - 21 = 106303254645223 is a prime.
It is a super-2 number, since 2×1063032546452252 (a number of 29 digits) contains 22 as substring.
It is not an unprimeable number, because it can be changed into a prime (106303254645223) by changing a digit.
It is a polite number, since it can be written in 71 ways as a sum of consecutive naturals, for example, 75912852 + ... + 77300501.
It is an arithmetic number, because the mean of its divisors is an integer number (2757942514236).
Almost surely, 2106303254645225 is an apocalyptic number.
106303254645225 is a gapful number since it is divisible by the number (15) formed by its first and last digit.
It is an amenable number.
106303254645225 is a deficient number, since it is larger than the sum of its proper divisors (92268606379767).
106303254645225 is a wasteful number, since it uses less digits than its factorization.
106303254645225 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 153213435 (or 153213401 counting only the distinct ones).
The product of its (nonzero) digits is 5184000, while the sum is 48.
The spelling of 106303254645225 in words is "one hundred six trillion, three hundred three billion, two hundred fifty-four million, six hundred forty-five thousand, two hundred twenty-five".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.081 sec. • engine limits •