Base | Representation |
---|---|
bin | 101000110111101… |
… | …0110111001011011 |
3 | 10112120110202200100 |
4 | 1101233112321123 |
5 | 10302032302201 |
6 | 344025110443 |
7 | 45661305333 |
oct | 12157267133 |
9 | 3476422610 |
10 | 1371369051 |
11 | 644113958 |
12 | 323328423 |
13 | 18b1659a0 |
14 | d01bc0c3 |
15 | 805db886 |
hex | 51bd6e5b |
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".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.119 sec. • engine limits •