Base | Representation |
---|---|
bin | 100011100110010100… |
… | …111000011011100011 |
3 | 10122122220010222012011 |
4 | 203212110320123203 |
5 | 1111240314101232 |
6 | 25320532213351 |
7 | 2522140254541 |
oct | 434624703343 |
9 | 118586128164 |
10 | 38223972067 |
11 | 15235487a66 |
12 | 74a916a257 |
13 | 37b2136868 |
14 | 1bc8774d91 |
15 | edab16547 |
hex | 8e65386e3 |
38223972067 has 8 divisors (see below), whose sum is σ = 41172526080. Its totient is φ = 35382638280.
The previous prime is 38223972053. The next prime is 38223972079. The reversal of 38223972067 is 76027932283.
38223972067 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is a sphenic number, since it is the product of 3 distinct primes.
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-38223972067 is a prime.
It is a super-2 number, since 2×382239720672 (a number of 22 digits) contains 22 as substring.
It is a Duffinian number.
It is a self number, because there is not a number n which added to its sum of digits gives 38223972067.
It is not an unprimeable number, because it can be changed into a prime (38223972467) by changing a digit.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 26804317 + ... + 26805742.
It is an arithmetic number, because the mean of its divisors is an integer number (5146565760).
Almost surely, 238223972067 is an apocalyptic number.
38223972067 is a deficient number, since it is larger than the sum of its proper divisors (2948554013).
38223972067 is a wasteful number, since it uses less digits than its factorization.
38223972067 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 53610113.
The product of its (nonzero) digits is 1524096, while the sum is 49.
The spelling of 38223972067 in words is "thirty-eight billion, two hundred twenty-three million, nine hundred seventy-two thousand, sixty-seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •