Base | Representation |
---|---|
bin | 1011101010000000100… |
… | …0001101101001110011 |
3 | 201010220010010012012021 |
4 | 2322200020031221303 |
5 | 11240110240101001 |
6 | 231555035412311 |
7 | 20316335304502 |
oct | 2724010155163 |
9 | 633803105167 |
10 | 200255003251 |
11 | 77a22801996 |
12 | 32988bb4097 |
13 | 15b650c3c84 |
14 | 9999d00839 |
15 | 5320a45ba1 |
hex | 2ea020da73 |
200255003251 has 8 divisors (see below), whose sum is σ = 201322940000. Its totient is φ = 199187683200.
The previous prime is 200255003243. The next prime is 200255003281. The reversal of 200255003251 is 152300552002.
It is a happy number.
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 200255003251 - 23 = 200255003243 is a prime.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (200255003281) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (17) of ones.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 504475 + ... + 809323.
It is an arithmetic number, because the mean of its divisors is an integer number (25165367500).
Almost surely, 2200255003251 is an apocalyptic number.
200255003251 is a deficient number, since it is larger than the sum of its proper divisors (1067936749).
200255003251 is a wasteful number, since it uses less digits than its factorization.
200255003251 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 308349.
The product of its (nonzero) digits is 3000, while the sum is 25.
Adding to 200255003251 its reverse (152300552002), we get a palindrome (352555555253).
The spelling of 200255003251 in words is "two hundred billion, two hundred fifty-five million, three thousand, two hundred fifty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •