Base | Representation |
---|---|
bin | 1111011010101111… |
… | …0000001111111101 |
3 | 101200102121222000022 |
4 | 3312223300033331 |
5 | 31433444234312 |
6 | 1522401541525 |
7 | 204363033410 |
oct | 36653601775 |
9 | 11612558008 |
10 | 4138664957 |
11 | 1834194269 |
12 | 9760448a5 |
13 | 50c58219b |
14 | 2b392bb77 |
15 | 193516172 |
hex | f6af03fd |
4138664957 has 4 divisors (see below), whose sum is σ = 4729902816. Its totient is φ = 3547427100.
The previous prime is 4138664923. The next prime is 4138664983. The reversal of 4138664957 is 7594668314.
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: 7594668314 = 2 ⋅3797334157.
It is not a de Polignac number, because 4138664957 - 210 = 4138663933 is a prime.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 4138664899 and 4138664908.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (4138564957) 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, 295618919 + ... + 295618932.
It is an arithmetic number, because the mean of its divisors is an integer number (1182475704).
Almost surely, 24138664957 is an apocalyptic number.
It is an amenable number.
4138664957 is a deficient number, since it is larger than the sum of its proper divisors (591237859).
4138664957 is an equidigital number, since it uses as much as digits as its factorization.
4138664957 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 591237858.
The product of its digits is 4354560, while the sum is 53.
The square root of 4138664957 is about 64332.4564819345. The cubic root of 4138664957 is about 1605.5361552152.
The spelling of 4138664957 in words is "four billion, one hundred thirty-eight million, six hundred sixty-four thousand, nine hundred fifty-seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •