Search a number
-
+
1451268050 = 25229025361
BaseRepresentation
bin101011010000000…
…1001011111010010
310202010211001111112
41112200021133102
510433011034200
6400001413322
750651401121
oct12640113722
93663731445
101451268050
11685226191
1234603a242
131a188c0bb
14daa59ab8
1587620535
hex568097d2

1451268050 has 12 divisors (see below), whose sum is σ = 2699358666. Its totient is φ = 580507200.

The previous prime is 1451268037. The next prime is 1451268059. The reversal of 1451268050 is 508621541.

It can be written as a sum of positive squares in 3 ways, for example, as 755205361 + 696062689 = 27481^2 + 26383^2 .

It is a Curzon number.

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

It is not an unprimeable number, because it can be changed into a prime (1451268059) by changing a digit.

It is a polite number, since it can be written in 5 ways as a sum of consecutive naturals, for example, 14512631 + ... + 14512730.

Almost surely, 21451268050 is an apocalyptic number.

1451268050 is a gapful number since it is divisible by the number (10) formed by its first and last digit.

1451268050 is a deficient number, since it is larger than the sum of its proper divisors (1248090616).

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

1451268050 is an evil number, because the sum of its binary digits is even.

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

The product of its (nonzero) digits is 9600, while the sum is 32.

The square root of 1451268050 is about 38095.5122028829. The cubic root of 1451268050 is about 1132.1810409584.

Adding to 1451268050 its reverse (508621541), we get a palindrome (1959889591).

The spelling of 1451268050 in words is "one billion, four hundred fifty-one million, two hundred sixty-eight thousand, fifty".

Divisors: 1 2 5 10 25 50 29025361 58050722 145126805 290253610 725634025 1451268050