Base | Representation |
---|---|
bin | 10001100101110010111111… |
… | …11100010001000011000011 |
3 | 12001221222020000112102201211 |
4 | 20302321133330101003003 |
5 | 20032231402241224023 |
6 | 214134145442110551 |
7 | 11101455062202115 |
oct | 1062713774210303 |
9 | 161858200472654 |
10 | 38682085101763 |
11 | 11363a86666764 |
12 | 4408a2004b457 |
13 | 1877921a9832c |
14 | 97a3199373b5 |
15 | 47132314da0d |
hex | 232e5ff110c3 |
38682085101763 has 2 divisors, whose sum is σ = 38682085101764. Its totient is φ = 38682085101762.
The previous prime is 38682085101731. The next prime is 38682085101791. The reversal of 38682085101763 is 36710158028683.
It is a happy number.
38682085101763 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is a strong prime.
It is a cyclic number.
It is not a de Polignac number, because 38682085101763 - 25 = 38682085101731 is a prime.
It is a junction number, because it is equal to n+sod(n) for n = 38682085101698 and 38682085101707.
It is not a weakly prime, because it can be changed into another prime (38682085101263) 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 as a sum of consecutive naturals, namely, 19341042550881 + 19341042550882.
It is an arithmetic number, because the mean of its divisors is an integer number (19341042550882).
Almost surely, 238682085101763 is an apocalyptic number.
38682085101763 is a deficient number, since it is larger than the sum of its proper divisors (1).
38682085101763 is an equidigital number, since it uses as much as digits as its factorization.
38682085101763 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 11612160, while the sum is 58.
The spelling of 38682085101763 in words is "thirty-eight trillion, six hundred eighty-two billion, eighty-five million, one hundred one thousand, seven hundred sixty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.082 sec. • engine limits •