Base | Representation |
---|---|
bin | 10111000001101101110110… |
… | …110000001000010011000101 |
3 | 111021120121101022201000011212 |
4 | 113001231312300020103011 |
5 | 101233224124201411043 |
6 | 555220104100141205 |
7 | 30221506666253600 |
oct | 2701556660102305 |
9 | 437517338630155 |
10 | 101273026200773 |
11 | 2a2a5716120809 |
12 | b437483697805 |
13 | 446800bb0442b |
14 | 1b018d7c19337 |
15 | ba95255d8018 |
hex | 5c1b76c084c5 |
101273026200773 has 12 divisors (see below), whose sum is σ = 117808158545280. Its totient is φ = 86804890498872.
The previous prime is 101273026200751. The next prime is 101273026200781. The reversal of 101273026200773 is 377002620372101.
It is not a de Polignac number, because 101273026200773 - 214 = 101273026184389 is a prime.
It is a self number, because there is not a number n which added to its sum of digits gives 101273026200773.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (101273026205773) by changing a digit.
It is a polite number, since it can be written in 11 ways as a sum of consecutive naturals, for example, 1083818 + ... + 14273076.
It is an arithmetic number, because the mean of its divisors is an integer number (9817346545440).
Almost surely, 2101273026200773 is an apocalyptic number.
It is an amenable number.
101273026200773 is a deficient number, since it is larger than the sum of its proper divisors (16535132344507).
101273026200773 is a wasteful number, since it uses less digits than its factorization.
101273026200773 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 13345976 (or 13345969 counting only the distinct ones).
The product of its (nonzero) digits is 148176, while the sum is 41.
Adding to 101273026200773 its reverse (377002620372101), we get a palindrome (478275646572874).
The spelling of 101273026200773 in words is "one hundred one trillion, two hundred seventy-three billion, twenty-six million, two hundred thousand, seven hundred seventy-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.097 sec. • engine limits •