Base | Representation |
---|---|
bin | 100011011101000110… |
… | …010110111110000001 |
3 | 10122021002212012202002 |
4 | 203131012112332001 |
5 | 1110431201420144 |
6 | 25253322233345 |
7 | 2515250414651 |
oct | 433506267601 |
9 | 118232765662 |
10 | 38069170049 |
11 | 15166065a09 |
12 | 7465355855 |
13 | 3789046031 |
14 | 1bb1d9a361 |
15 | ecc23914e |
hex | 8dd196f81 |
38069170049 has 4 divisors (see below), whose sum is σ = 38070781764. Its totient is φ = 38067558336.
The previous prime is 38069170039. The next prime is 38069170057. The reversal of 38069170049 is 94007196083.
38069170049 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.
It can be written as a sum of positive squares in 2 ways, for example, as 29115279424 + 8953890625 = 170632^2 + 94625^2 .
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-38069170049 is a prime.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 38069169985 and 38069170012.
It is not an unprimeable number, because it can be changed into a prime (38069170039) 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, 769892 + ... + 817845.
It is an arithmetic number, because the mean of its divisors is an integer number (9517695441).
Almost surely, 238069170049 is an apocalyptic number.
It is an amenable number.
38069170049 is a deficient number, since it is larger than the sum of its proper divisors (1611715).
38069170049 is a wasteful number, since it uses less digits than its factorization.
38069170049 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 1611714.
The product of its (nonzero) digits is 326592, while the sum is 47.
The spelling of 38069170049 in words is "thirty-eight billion, sixty-nine million, one hundred seventy thousand, forty-nine".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •