Base | Representation |
---|---|
bin | 110001111001010… |
… | …1110100000001001 |
3 | 11022200101022100002 |
4 | 1203302232200021 |
5 | 11412101221212 |
6 | 434044452345 |
7 | 56326552115 |
oct | 14362564011 |
9 | 4280338302 |
10 | 1674242057 |
11 | 78a07a924 |
12 | 3a884a0b5 |
13 | 208b2b397 |
14 | 11c4dc745 |
15 | 9beb6ac2 |
hex | 63cae809 |
1674242057 has 4 divisors (see below), whose sum is σ = 1762360080. Its totient is φ = 1586124036.
The previous prime is 1674242047. The next prime is 1674242077. The reversal of 1674242057 is 7502424761.
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, and also an emirpimes, since its reverse is a distinct semiprime: 7502424761 = 13 ⋅577109597.
It is a cyclic number.
It is not a de Polignac number, because 1674242057 - 24 = 1674242041 is a prime.
It is a Duffinian number.
It is a self number, because there is not a number n which added to its sum of digits gives 1674242057.
It is not an unprimeable number, because it can be changed into a prime (1674242047) 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, 44058983 + ... + 44059020.
It is an arithmetic number, because the mean of its divisors is an integer number (440590020).
Almost surely, 21674242057 is an apocalyptic number.
It is an amenable number.
1674242057 is a deficient number, since it is larger than the sum of its proper divisors (88118023).
1674242057 is an equidigital number, since it uses as much as digits as its factorization.
1674242057 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 88118022.
The product of its (nonzero) digits is 94080, while the sum is 38.
The square root of 1674242057 is about 40917.5030640923. The cubic root of 1674242057 is about 1187.4247104547.
The spelling of 1674242057 in words is "one billion, six hundred seventy-four million, two hundred forty-two thousand, fifty-seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •