Base | Representation |
---|---|
bin | 101101011111111001011100… |
… | …001001100111110000110101 |
3 | 222020111202120212010001020211 |
4 | 231133321130021213300311 |
5 | 202212001120010043202 |
6 | 1545330313005025421 |
7 | 60102020311546042 |
oct | 5537713411476065 |
9 | 866452525101224 |
10 | 200104072346677 |
11 | 5883972a156814 |
12 | 1a539614b55271 |
13 | 878696b6a09c5 |
14 | 375b13586c1c9 |
15 | 1820275a901d7 |
hex | b5fe5c267c35 |
200104072346677 has 2 divisors, whose sum is σ = 200104072346678. Its totient is φ = 200104072346676.
The previous prime is 200104072346641. The next prime is 200104072346723. The reversal of 200104072346677 is 776643270401002.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 191346106849681 + 8757965496996 = 13832791^2 + 2959386^2 .
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-200104072346677 is a prime.
It is a self number, because there is not a number n which added to its sum of digits gives 200104072346677.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (200104072386677) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 100052036173338 + 100052036173339.
It is an arithmetic number, because the mean of its divisors is an integer number (100052036173339).
Almost surely, 2200104072346677 is an apocalyptic number.
It is an amenable number.
200104072346677 is a deficient number, since it is larger than the sum of its proper divisors (1).
200104072346677 is an equidigital number, since it uses as much as digits as its factorization.
200104072346677 is an evil number, because the sum of its binary digits is even.
The product of its (nonzero) digits is 2370816, while the sum is 49.
The spelling of 200104072346677 in words is "two hundred trillion, one hundred four billion, seventy-two million, three hundred forty-six thousand, six hundred seventy-seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.080 sec. • engine limits •