Base | Representation |
---|---|
bin | 100100001110000111… |
… | …101011110111111111 |
3 | 10201101102102001110202 |
4 | 210032013223313333 |
5 | 1114122222221112 |
6 | 25511101554115 |
7 | 2544525105011 |
oct | 441607536777 |
9 | 121342361422 |
10 | 38891601407 |
11 | 1554832784a |
12 | 765487593b |
13 | 388a550bc9 |
14 | 1c4d2c41b1 |
15 | 10295426c2 |
hex | 90e1ebdff |
38891601407 has 4 divisors (see below), whose sum is σ = 39719082336. Its totient is φ = 38064120480.
The previous prime is 38891601401. The next prime is 38891601433. The reversal of 38891601407 is 70410619883.
It is a semiprime because it is the product of two primes.
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-38891601407 is a prime.
It is a Harshad number since it is a multiple of its sum of digits (47), and also a Moran number because the ratio is a prime number: 827480881 = 38891601407 / (3 + 8 + 8 + 9 + 1 + 6 + 0 + 1 + 4 + 0 + 7).
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (38891601401) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (23) of ones.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 413740394 + ... + 413740487.
It is an arithmetic number, because the mean of its divisors is an integer number (9929770584).
Almost surely, 238891601407 is an apocalyptic number.
38891601407 is a deficient number, since it is larger than the sum of its proper divisors (827480929).
38891601407 is an equidigital number, since it uses as much as digits as its factorization.
38891601407 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 827480928.
The product of its (nonzero) digits is 290304, while the sum is 47.
The spelling of 38891601407 in words is "thirty-eight billion, eight hundred ninety-one million, six hundred one thousand, four hundred seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.067 sec. • engine limits •