Base | Representation |
---|---|
bin | 100011101110101001… |
… | …001010100010101101 |
3 | 10200000121201001221111 |
4 | 203232221022202231 |
5 | 1112032024204421 |
6 | 25342435032021 |
7 | 2525453266531 |
oct | 435651124255 |
9 | 120017631844 |
10 | 38363506861 |
11 | 152a7221579 |
12 | 7527a3b611 |
13 | 3805010224 |
14 | 1bdd0d7bc1 |
15 | ee7ec9ee1 |
hex | 8eea4a8ad |
38363506861 has 4 divisors (see below), whose sum is σ = 38364199552. Its totient is φ = 38362814172.
The previous prime is 38363506837. The next prime is 38363506901. The reversal of 38363506861 is 16860536383.
38363506861 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
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: 16860536383 = 127 ⋅132760129.
It is a cyclic number.
It is not a de Polignac number, because 38363506861 - 27 = 38363506733 is a prime.
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (38363506261) 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, 255291 + ... + 376696.
It is an arithmetic number, because the mean of its divisors is an integer number (9591049888).
Almost surely, 238363506861 is an apocalyptic number.
It is an amenable number.
38363506861 is a deficient number, since it is larger than the sum of its proper divisors (692691).
38363506861 is an equidigital number, since it uses as much as digits as its factorization.
38363506861 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 692690.
The product of its (nonzero) digits is 1866240, while the sum is 49.
The spelling of 38363506861 in words is "thirty-eight billion, three hundred sixty-three million, five hundred six thousand, eight hundred sixty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •