Base | Representation |
---|---|
bin | 1001101111010000100000… |
… | …0001011111010011001111 |
3 | 1101220121220020212101010202 |
4 | 2123310020001133103033 |
5 | 2400412413421431012 |
6 | 34434541353524115 |
7 | 2153406351645161 |
oct | 233641001372317 |
9 | 41817806771122 |
10 | 10707488077007 |
11 | 345902496a807 |
12 | 124b22411363b |
13 | 5c8933a6a557 |
14 | 290360b20931 |
15 | 1387d65c4cc2 |
hex | 9bd0805f4cf |
10707488077007 has 8 divisors (see below), whose sum is σ = 11271080223360. Its totient is φ = 10143899944920.
The previous prime is 10707488077003. The next prime is 10707488077067. The reversal of 10707488077007 is 70077088470701.
10707488077007 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is a sphenic number, since it is the product of 3 distinct primes.
It is a cyclic number.
It is not a de Polignac number, because 10707488077007 - 22 = 10707488077003 is a prime.
It is a super-2 number, since 2×107074880770072 (a number of 27 digits) contains 22 as substring.
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (10707488077003) by changing a digit.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 5578532 + ... + 7248102.
It is an arithmetic number, because the mean of its divisors is an integer number (1408885027920).
Almost surely, 210707488077007 is an apocalyptic number.
10707488077007 is a deficient number, since it is larger than the sum of its proper divisors (563592146353).
10707488077007 is a wasteful number, since it uses less digits than its factorization.
10707488077007 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 2007133.
The product of its (nonzero) digits is 4302592, while the sum is 56.
The spelling of 10707488077007 in words is "ten trillion, seven hundred seven billion, four hundred eighty-eight million, seventy-seven thousand, seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.078 sec. • engine limits •