Base | Representation |
---|---|
bin | 101000111110010… |
… | …1001101101010011 |
3 | 10112211000211002110 |
4 | 1101330221231103 |
5 | 10303430311341 |
6 | 344231520403 |
7 | 46033031421 |
oct | 12174515523 |
9 | 3484024073 |
10 | 1374853971 |
11 | 646084157 |
12 | 324529103 |
13 | 18bab5c7a |
14 | d0848111 |
15 | 80a79216 |
hex | 51f29b53 |
1374853971 has 8 divisors (see below), whose sum is σ = 1940970384. Its totient is φ = 862653440.
The previous prime is 1374853967. The next prime is 1374853993. The reversal of 1374853971 is 1793584731.
It is a sphenic number, since it is the product of 3 distinct primes.
It is not a de Polignac number, because 1374853971 - 22 = 1374853967 is a prime.
It is a self number, because there is not a number n which added to its sum of digits gives 1374853971.
It is not an unprimeable number, because it can be changed into a prime (1374853901) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (17) of ones.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 13478910 + ... + 13479011.
It is an arithmetic number, because the mean of its divisors is an integer number (242621298).
Almost surely, 21374853971 is an apocalyptic number.
1374853971 is a deficient number, since it is larger than the sum of its proper divisors (566116413).
1374853971 is a wasteful number, since it uses less digits than its factorization.
1374853971 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 26957941.
The product of its digits is 635040, while the sum is 48.
The square root of 1374853971 is about 37079.0233285614. The cubic root of 1374853971 is about 1111.9506783651.
The spelling of 1374853971 in words is "one billion, three hundred seventy-four million, eight hundred fifty-three thousand, nine hundred seventy-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.082 sec. • engine limits •