Base | Representation |
---|---|
bin | 1001110011000010001001… |
… | …1010011010011011010101 |
3 | 1102010211022222001010122012 |
4 | 2130300202122122123111 |
5 | 2402443240430441301 |
6 | 34524430212114005 |
7 | 2161164002326142 |
oct | 234604232323325 |
9 | 42124288033565 |
10 | 10772355327701 |
11 | 3483591825300 |
12 | 125b908005905 |
13 | 601aa09b7326 |
14 | 293555b9b3c9 |
15 | 13a3312aaebb |
hex | 9cc2269a6d5 |
10772355327701 has 36 divisors (see below), whose sum is σ = 13240180175040. Its totient is φ = 8731883318400.
The previous prime is 10772355327649. The next prime is 10772355327703.
10772355327701 is nontrivially palindromic in base 10.
It is not a de Polignac number, because 10772355327701 - 26 = 10772355327637 is a prime.
It is a self number, because there is not a number n which added to its sum of digits gives 10772355327701.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (10772355327703) by changing a digit.
It is a polite number, since it can be written in 35 ways as a sum of consecutive naturals, for example, 7442285 + ... + 8771106.
It is an arithmetic number, because the mean of its divisors is an integer number (367782782640).
Almost surely, 210772355327701 is an apocalyptic number.
10772355327701 is a gapful number since it is divisible by the number (11) formed by its first and last digit.
It is an amenable number.
10772355327701 is a deficient number, since it is larger than the sum of its proper divisors (2467824847339).
10772355327701 is a wasteful number, since it uses less digits than its factorization.
10772355327701 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 16213466 (or 16213438 counting only the distinct ones).
The product of its (nonzero) digits is 2160900, while the sum is 50.
The spelling of 10772355327701 in words is "ten trillion, seven hundred seventy-two billion, three hundred fifty-five million, three hundred twenty-seven thousand, seven hundred one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.078 sec. • engine limits •