Base | Representation |
---|---|
bin | 1110011010100111… |
… | …1111101111001001 |
3 | 100222200122121121210 |
4 | 3212221333233021 |
5 | 30411130044044 |
6 | 1435554323333 |
7 | 164616330225 |
oct | 34651775711 |
9 | 10880577553 |
10 | 3869768649 |
11 | 170642450a |
12 | 8bbb89549 |
13 | 498954846 |
14 | 289d33785 |
15 | 179aed1b9 |
hex | e6a7fbc9 |
3869768649 has 4 divisors (see below), whose sum is σ = 5159691536. Its totient is φ = 2579845764.
The previous prime is 3869768629. The next prime is 3869768663. The reversal of 3869768649 is 9468679683.
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: 9468679683 = 3 ⋅3156226561.
It is not a de Polignac number, because 3869768649 - 29 = 3869768137 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 3869768649.
It is not an unprimeable number, because it can be changed into a prime (3869768629) 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, 644961439 + ... + 644961444.
It is an arithmetic number, because the mean of its divisors is an integer number (1289922884).
Almost surely, 23869768649 is an apocalyptic number.
It is an amenable number.
3869768649 is a deficient number, since it is larger than the sum of its proper divisors (1289922887).
3869768649 is a wasteful number, since it uses less digits than its factorization.
3869768649 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1289922886.
The product of its digits is 94058496, while the sum is 66.
The square root of 3869768649 is about 62207.4645762066. The cubic root of 3869768649 is about 1569.9831835866.
The spelling of 3869768649 in words is "three billion, eight hundred sixty-nine million, seven hundred sixty-eight thousand, six hundred forty-nine".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.085 sec. • engine limits •