Search a number
-
+
1371369051 = 321322352561
BaseRepresentation
bin101000110111101…
…0110111001011011
310112120110202200100
41101233112321123
510302032302201
6344025110443
745661305333
oct12157267133
93476422610
101371369051
11644113958
12323328423
1318b1659a0
14d01bc0c3
15805db886
hex51bd6e5b

1371369051 has 24 divisors (see below), whose sum is σ = 2142847616. Its totient is φ = 840119040.

The previous prime is 1371369001. The next prime is 1371369071. The reversal of 1371369051 is 1509631731.

It is not a de Polignac number, because 1371369051 - 27 = 1371368923 is a prime.

It is a Smith number, since the sum of its digits (36) coincides with the sum of the digits of its prime factors.

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

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

It is a pernicious number, because its binary representation contains a prime number (19) of ones.

It is a polite number, since it can be written in 23 ways as a sum of consecutive naturals, for example, 190 + ... + 52371.

Almost surely, 21371369051 is an apocalyptic number.

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

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

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

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

The product of its (nonzero) digits is 17010, while the sum is 36.

The square root of 1371369051 is about 37032.0003645496. Note that the first 3 decimals coincide. The cubic root of 1371369051 is about 1111.0103753781.

The spelling of 1371369051 in words is "one billion, three hundred seventy-one million, three hundred sixty-nine thousand, fifty-one".

Divisors: 1 3 9 13 39 117 223 669 2007 2899 8697 26091 52561 157683 473049 683293 2049879 6149637 11721103 35163309 105489927 152374339 457123017 1371369051