Base | Representation |
---|---|
bin | 10111110011110000000000… |
… | …000100100010101010111110 |
3 | 111201202022011210201120110010 |
4 | 113303300000010202222332 |
5 | 102211042222242221240 |
6 | 1010411413043124050 |
7 | 31025066503231515 |
oct | 2763600004425276 |
9 | 451668153646403 |
10 | 104711303867070 |
11 | 304008a624003a |
12 | b8b1903973626 |
13 | 4657306258c44 |
14 | 1bc00a882567c |
15 | c18babde6280 |
hex | 5f3c00122abe |
104711303867070 has 32 divisors (see below), whose sum is σ = 251375475243168. Its totient is φ = 27915420368768.
The previous prime is 104711303867069. The next prime is 104711303867099. The reversal of 104711303867070 is 70768303117401.
It is a Curzon number.
It is a congruent number.
It is an unprimeable number.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 474512589 + ... + 474733208.
It is an arithmetic number, because the mean of its divisors is an integer number (7855483601349).
Almost surely, 2104711303867070 is an apocalyptic number.
104711303867070 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
104711303867070 is an abundant number, since it is smaller than the sum of its proper divisors (146664171376098).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
104711303867070 is a wasteful number, since it uses less digits than its factorization.
104711303867070 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 949249484.
The product of its (nonzero) digits is 592704, while the sum is 48.
The spelling of 104711303867070 in words is "one hundred four trillion, seven hundred eleven billion, three hundred three million, eight hundred sixty-seven thousand, seventy".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.062 sec. • engine limits •