Base | Representation |
---|---|
bin | 10111110110001… |
… | …10001011000001 |
3 | 111221102010212121 |
4 | 23323012023001 |
5 | 402202304103 |
6 | 31503324241 |
7 | 4646215234 |
oct | 1373061301 |
9 | 457363777 |
10 | 200041153 |
11 | a2a10974 |
12 | 56bb0681 |
13 | 3259cc60 |
14 | 1c7d341b |
15 | 128666bd |
hex | bec62c1 |
200041153 has 8 divisors (see below), whose sum is σ = 215649000. Its totient is φ = 184464768.
The previous prime is 200041147. The next prime is 200041157. The reversal of 200041153 is 351140002.
200041153 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It can be written as a sum of positive squares in 4 ways, for example, as 47444544 + 152596609 = 6888^2 + 12353^2 .
It is a sphenic number, since it is the product of 3 distinct primes.
It is a cyclic number.
It is not a de Polignac number, because 200041153 - 213 = 200032961 is a prime.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (200041157) by changing a digit.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 6303 + ... + 20971.
It is an arithmetic number, because the mean of its divisors is an integer number (26956125).
Almost surely, 2200041153 is an apocalyptic number.
It is an amenable number.
200041153 is a deficient number, since it is larger than the sum of its proper divisors (15607847).
200041153 is a wasteful number, since it uses less digits than its factorization.
200041153 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 15731.
The product of its (nonzero) digits is 120, while the sum is 16.
The square root of 200041153 is about 14143.5905271611. The cubic root of 200041153 is about 584.8436555924.
Adding to 200041153 its reverse (351140002), we get a palindrome (551181155).
The spelling of 200041153 in words is "two hundred million, forty-one thousand, one hundred fifty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •