Base | Representation |
---|---|
bin | 1100111111111100… |
… | …0101010111010101 |
3 | 100000011221221101211 |
4 | 3033333011113111 |
5 | 24121242431012 |
6 | 1334130221421 |
7 | 152320405234 |
oct | 31777052725 |
9 | 10004857354 |
10 | 3489420757 |
11 | 1530761509 |
12 | 814724871 |
13 | 437c04214 |
14 | 251606b1b |
15 | 15651c6a7 |
hex | cffc55d5 |
3489420757 has 4 divisors (see below), whose sum is σ = 3533590720. Its totient is φ = 3445250796.
The previous prime is 3489420749. The next prime is 3489420787. The reversal of 3489420757 is 7570249843.
It is a happy number.
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 3489420757 - 23 = 3489420749 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 3489420757.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (3489420787) 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, 22084863 + ... + 22085020.
It is an arithmetic number, because the mean of its divisors is an integer number (883397680).
Almost surely, 23489420757 is an apocalyptic number.
It is an amenable number.
3489420757 is a deficient number, since it is larger than the sum of its proper divisors (44169963).
3489420757 is an equidigital number, since it uses as much as digits as its factorization.
3489420757 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 44169962.
The product of its (nonzero) digits is 1693440, while the sum is 49.
The square root of 3489420757 is about 59071.3192420823. The cubic root of 3489420757 is about 1516.7631890643.
The spelling of 3489420757 in words is "three billion, four hundred eighty-nine million, four hundred twenty thousand, seven hundred fifty-seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.064 sec. • engine limits •