Base | Representation |
---|---|
bin | 11010000101001010011111… |
… | …111101111010011110101000 |
3 | 120001010121021120202102101000 |
4 | 122011022133331322132220 |
5 | 110013302424041232012 |
6 | 1043542154352355000 |
7 | 33106045020354042 |
oct | 3205123775723650 |
9 | 501117246672330 |
10 | 114704080414632 |
11 | 33603800079355 |
12 | 10a46504545a60 |
13 | 4c00718a02547 |
14 | 20479c846ca92 |
15 | d3dab2ad1ddc |
hex | 68529ff7a7a8 |
114704080414632 has 128 divisors (see below), whose sum is σ = 335724460560000. Its totient is φ = 36186440629248.
The previous prime is 114704080414631. The next prime is 114704080414669. The reversal of 114704080414632 is 236414080407411.
114704080414632 is a `hidden beast` number, since 1 + 1 + 4 + 7 + 0 + 4 + 0 + 8 + 0 + 4 + 1 + 4 + 632 = 666.
It is not an unprimeable number, because it can be changed into a prime (114704080414631) by changing a digit.
It is a polite number, since it can be written in 31 ways as a sum of consecutive naturals, for example, 9709083 + ... + 17990954.
It is an arithmetic number, because the mean of its divisors is an integer number (2622847348125).
Almost surely, 2114704080414632 is an apocalyptic number.
114704080414632 is a gapful number since it is divisible by the number (12) formed by its first and last digit.
It is an amenable number.
114704080414632 is an abundant number, since it is smaller than the sum of its proper divisors (221020380145368).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
114704080414632 is a wasteful number, since it uses less digits than its factorization.
114704080414632 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 27701080 (or 27701070 counting only the distinct ones).
The product of its (nonzero) digits is 516096, while the sum is 45.
The spelling of 114704080414632 in words is "one hundred fourteen trillion, seven hundred four billion, eighty million, four hundred fourteen thousand, six hundred thirty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.074 sec. • engine limits •