Search a number
-
+
1450252051 = 23671039137
BaseRepresentation
bin101011001110001…
…0001011100010011
310202001220102210221
41112130101130103
510432231031201
6355523533511
750636640043
oct12634213423
93661812727
101450252051
116846a1916
1234582a297
131a15c4811
14da873723
15874be4a1
hex56711713

1450252051 has 16 divisors (see below), whose sum is σ = 1550974464. Its totient is φ = 1353078144.

The previous prime is 1450252049. The next prime is 1450252073. The reversal of 1450252051 is 1502520541.

It is a cyclic number.

It is not a de Polignac number, because 1450252051 - 21 = 1450252049 is a prime.

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

It is a Duffinian number.

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

It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 154155 + ... + 163291.

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

Almost surely, 21450252051 is an apocalyptic number.

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

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

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

The sum of its prime factors is 9330.

The product of its (nonzero) digits is 2000, while the sum is 25.

The square root of 1450252051 is about 38082.1749772778. The cubic root of 1450252051 is about 1131.9167747439.

Adding to 1450252051 its reverse (1502520541), we get a palindrome (2952772592).

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

Divisors: 1 23 67 103 1541 2369 6901 9137 158723 210151 612179 941111 14080117 21645553 63054437 1450252051