Base | Representation |
---|---|
bin | 101000111100111… |
… | …1111010101111101 |
3 | 10112202201100212111 |
4 | 1101321333111331 |
5 | 10303240444112 |
6 | 344204534021 |
7 | 46024064113 |
oct | 12171772575 |
9 | 3482640774 |
10 | 1374156157 |
11 | 645747950 |
12 | 324251311 |
13 | 18b90046a |
14 | d0705ab3 |
15 | 8098c5a7 |
hex | 51e7f57d |
1374156157 has 4 divisors (see below), whose sum is σ = 1499079456. Its totient is φ = 1249232860.
The previous prime is 1374156143. The next prime is 1374156187. The reversal of 1374156157 is 7516514731.
It is a semiprime because it is the product of two primes, and also a Blum integer, because the two primes are equal to 3 mod 4.
It is a cyclic number.
It is not a de Polignac number, because 1374156157 - 211 = 1374154109 is a prime.
It is a Smith number, since the sum of its digits (40) coincides with the sum of the digits of its prime factors. Since it is squarefree, it is also a hoax number.
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (1374156187) by changing a digit.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 62461633 + ... + 62461654.
It is an arithmetic number, because the mean of its divisors is an integer number (374769864).
Almost surely, 21374156157 is an apocalyptic number.
It is an amenable number.
1374156157 is a deficient number, since it is larger than the sum of its proper divisors (124923299).
1374156157 is a wasteful number, since it uses less digits than its factorization.
1374156157 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 124923298.
The product of its digits is 88200, while the sum is 40.
The square root of 1374156157 is about 37069.6123125128. The cubic root of 1374156157 is about 1111.7625211546.
The spelling of 1374156157 in words is "one billion, three hundred seventy-four million, one hundred fifty-six thousand, one hundred fifty-seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.000 sec. • engine limits •