Base | Representation |
---|---|
bin | 10111000010110011010100… |
… | …000100011010010110100101 |
3 | 111021211201212221012200110212 |
4 | 113002303110010122112211 |
5 | 101240434344144231400 |
6 | 555314240401225205 |
7 | 30230060106203333 |
oct | 2702632404322645 |
9 | 437751787180425 |
10 | 101347606242725 |
11 | 2a324307663117 |
12 | b449a18332205 |
13 | 447206609ba7b |
14 | 1b05370c14b53 |
15 | bab43cd48335 |
hex | 5c2cd411a5a5 |
101347606242725 has 6 divisors (see below), whose sum is σ = 125671031741010. Its totient is φ = 81078084994160.
The previous prime is 101347606242689. The next prime is 101347606242763. The reversal of 101347606242725 is 527242606743101.
It can be written as a sum of positive squares in 3 ways, for example, as 4738188320644 + 96609417922081 = 2176738^2 + 9829009^2 .
It is not a de Polignac number, because 101347606242725 - 28 = 101347606242469 is a prime.
It is a super-2 number, since 2×1013476062427252 (a number of 29 digits) contains 22 as substring.
It is a congruent number.
It is an unprimeable number.
It is a polite number, since it can be written in 5 ways as a sum of consecutive naturals, for example, 2026952124830 + ... + 2026952124879.
It is an arithmetic number, because the mean of its divisors is an integer number (20945171956835).
Almost surely, 2101347606242725 is an apocalyptic number.
It is an amenable number.
101347606242725 is a deficient number, since it is larger than the sum of its proper divisors (24323425498285).
101347606242725 is an equidigital number, since it uses as much as digits as its factorization.
101347606242725 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 4053904249719 (or 4053904249714 counting only the distinct ones).
The product of its (nonzero) digits is 3386880, while the sum is 50.
The spelling of 101347606242725 in words is "one hundred one trillion, three hundred forty-seven billion, six hundred six million, two hundred forty-two thousand, seven hundred twenty-five".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.078 sec. • engine limits •