Base | Representation |
---|---|
bin | 10111111101001… |
… | …00110011100001 |
3 | 112000010110202211 |
4 | 23332210303201 |
5 | 402420444212 |
6 | 31535042121 |
7 | 4660033654 |
oct | 1376446341 |
9 | 460113684 |
10 | 200953057 |
11 | a3484008 |
12 | 57370341 |
13 | 3282c046 |
14 | 1c98d89b |
15 | 129969a7 |
hex | bfa4ce1 |
200953057 has 4 divisors (see below), whose sum is σ = 203024836. Its totient is φ = 198881280.
The previous prime is 200953037. The next prime is 200953069. The reversal of 200953057 is 750359002.
It is a happy number.
It is a semiprime because it is the product of two primes, and also an emirpimes, since its reverse is a distinct semiprime: 750359002 = 2 ⋅375179501.
It can be written as a sum of positive squares in 2 ways, for example, as 116294656 + 84658401 = 10784^2 + 9201^2 .
It is a cyclic number.
It is not a de Polignac number, because 200953057 - 27 = 200952929 is a prime.
It is a super-2 number, since 2×2009530572 = 80764262235290498, which contains 22 as substring.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (200953037) by changing a digit.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 1035744 + ... + 1035937.
It is an arithmetic number, because the mean of its divisors is an integer number (50756209).
Almost surely, 2200953057 is an apocalyptic number.
It is an amenable number.
200953057 is a deficient number, since it is larger than the sum of its proper divisors (2071779).
200953057 is an equidigital number, since it uses as much as digits as its factorization.
200953057 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 2071778.
The product of its (nonzero) digits is 9450, while the sum is 31.
The square root of 200953057 is about 14175.7912301219. The cubic root of 200953057 is about 585.7309945405.
The spelling of 200953057 in words is "two hundred million, nine hundred fifty-three thousand, fifty-seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.065 sec. • engine limits •