Search a number
-
+
465200050 = 25271329143
BaseRepresentation
bin11011101110100…
…110001110110010
31012102100121111111
4123232212032302
51423042400200
6114054503534
714346064240
oct3356461662
91172317444
10465200050
11219658757
1210b964baa
13754bc403
1445ad7790
152ac920ba
hex1bba63b2

465200050 has 24 divisors (see below), whose sum is σ = 988883136. Its totient is φ = 159497040.

The previous prime is 465200033. The next prime is 465200083. The reversal of 465200050 is 50002564.

It is a super-2 number, since 2×4652000502 = 432822173040005000, which contains 22 as substring.

It is a junction number, because it is equal to n+sod(n) for n = 465199994 and 465200030.

It is an unprimeable number.

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 11 ways as a sum of consecutive naturals, for example, 664222 + ... + 664921.

It is an arithmetic number, because the mean of its divisors is an integer number (41203464).

Almost surely, 2465200050 is an apocalyptic number.

465200050 is an abundant number, since it is smaller than the sum of its proper divisors (523683086).

It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.

465200050 is a wasteful number, since it uses less digits than its factorization.

465200050 is an odious number, because the sum of its binary digits is odd.

The sum of its prime factors is 1329162 (or 1329157 counting only the distinct ones).

The product of its (nonzero) digits is 1200, while the sum is 22.

The square root of 465200050 is about 21568.4967023666. The cubic root of 465200050 is about 774.8421738968.

The spelling of 465200050 in words is "four hundred sixty-five million, two hundred thousand, fifty".

Divisors: 1 2 5 7 10 14 25 35 50 70 175 350 1329143 2658286 6645715 9304001 13291430 18608002 33228575 46520005 66457150 93040010 232600025 465200050