Base | Representation |
---|---|
bin | 101101101001010010100010… |
… | …111110101100101011111111 |
3 | 222022210110120012221122002222 |
4 | 231221102202332230223333 |
5 | 202303034441433304444 |
6 | 1550543014431035555 |
7 | 60166446616210040 |
oct | 5551224276545377 |
9 | 868713505848088 |
10 | 200749505759999 |
11 | 58a68429522189 |
12 | 1a62272336bbbb |
13 | 880279bc7c421 |
14 | 3780483b628c7 |
15 | 1831e4e40eeee |
hex | b694a2facaff |
200749505759999 has 4 divisors (see below), whose sum is σ = 229428006582864. Its totient is φ = 172071004937136.
The previous prime is 200749505759989. The next prime is 200749505760017. The reversal of 200749505759999 is 999957505947002.
It is a semiprime because it is the product of two primes.
It is a cyclic number.
It is not a de Polignac number, because 200749505759999 - 24 = 200749505759983 is a prime.
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (200749505759989) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (29) of ones.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 14339250411422 + ... + 14339250411435.
It is an arithmetic number, because the mean of its divisors is an integer number (57357001645716).
Almost surely, 2200749505759999 is an apocalyptic number.
200749505759999 is a deficient number, since it is larger than the sum of its proper divisors (28678500822865).
200749505759999 is an equidigital number, since it uses as much as digits as its factorization.
200749505759999 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 28678500822864.
The product of its (nonzero) digits is 2893401000, while the sum is 80.
The spelling of 200749505759999 in words is "two hundred trillion, seven hundred forty-nine billion, five hundred five million, seven hundred fifty-nine thousand, nine hundred ninety-nine".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.079 sec. • engine limits •