Base | Representation |
---|---|
bin | 11010000101110010111000… |
… | …011110111100110011101110 |
3 | 120001021202012111002202111200 |
4 | 122011302320132330303232 |
5 | 110020010224444313240 |
6 | 1044014125153030330 |
7 | 33112141365563112 |
oct | 3205627036746356 |
9 | 501252174082450 |
10 | 114747441401070 |
11 | 33620131236235 |
12 | 10a529a5b553a6 |
13 | 4c0483919b07a |
14 | 2049b3d16d742 |
15 | d3ec9e6b6930 |
hex | 685cb87bccee |
114747441401070 has 24 divisors (see below), whose sum is σ = 298343347643016. Its totient is φ = 30599317706928.
The previous prime is 114747441401059. The next prime is 114747441401171. The reversal of 114747441401070 is 70104144747411.
114747441401070 is a `hidden beast` number, since 1 + 1 + 4 + 74 + 74 + 41 + 401 + 0 + 70 = 666.
It is a Harshad number since it is a multiple of its sum of digits (45).
It is a congruent number.
It is an unprimeable number.
It is a polite number, since it can be written in 11 ways as a sum of consecutive naturals, for example, 637485785472 + ... + 637485785651.
It is an arithmetic number, because the mean of its divisors is an integer number (12430972818459).
Almost surely, 2114747441401070 is an apocalyptic number.
114747441401070 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
114747441401070 is an abundant number, since it is smaller than the sum of its proper divisors (183595906241946).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
114747441401070 is a wasteful number, since it uses less digits than its factorization.
114747441401070 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1274971571136 (or 1274971571133 counting only the distinct ones).
The product of its (nonzero) digits is 351232, while the sum is 45.
The spelling of 114747441401070 in words is "one hundred fourteen trillion, seven hundred forty-seven billion, four hundred forty-one million, four hundred one thousand, seventy".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.081 sec. • engine limits •