Base | Representation |
---|---|
bin | 10001100110111001001000… |
… | …11011111001100010101100 |
3 | 12002002120102100121222110020 |
4 | 20303130210123321202230 |
5 | 20033341012303414141 |
6 | 214203334220442140 |
7 | 11104260201053655 |
oct | 1063344433714254 |
9 | 162076370558406 |
10 | 38719741466796 |
11 | 11378a4a7000a5 |
12 | 441418b0a9350 |
13 | 187b343438530 |
14 | 97c08cb5852c |
15 | 4722c8ee5266 |
hex | 2337246f98ac |
38719741466796 has 48 divisors (see below), whose sum is σ = 103019040651744. Its totient is φ = 11212956804096.
The previous prime is 38719741466761. The next prime is 38719741466801. The reversal of 38719741466796 is 69766414791783.
38719741466796 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is a Harshad number since it is a multiple of its sum of digits (78).
It is an unprimeable number.
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 15 ways as a sum of consecutive naturals, for example, 7300099435 + ... + 7300104738.
It is an arithmetic number, because the mean of its divisors is an integer number (2146230013578).
Almost surely, 238719741466796 is an apocalyptic number.
It is an amenable number.
38719741466796 is an abundant number, since it is smaller than the sum of its proper divisors (64299299184948).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
38719741466796 is a wasteful number, since it uses less digits than its factorization.
38719741466796 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 14600204210 (or 14600204208 counting only the distinct ones).
The product of its digits is 2304433152, while the sum is 78.
The spelling of 38719741466796 in words is "thirty-eight trillion, seven hundred nineteen billion, seven hundred forty-one million, four hundred sixty-six thousand, seven hundred ninety-six".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.083 sec. • engine limits •