Base | Representation |
---|---|
bin | 10001101000010001100101… |
… | …01110111001011101110001 |
3 | 12002021002222122002121010102 |
4 | 20310020302232321131301 |
5 | 20040130234321442442 |
6 | 214241230122242145 |
7 | 11110560666501305 |
oct | 1064106256713561 |
9 | 162232878077112 |
10 | 38767225968497 |
11 | 113970a7444034 |
12 | 4421421656355 |
13 | 188296ccb0710 |
14 | 9804b5361d05 |
15 | 473657aec232 |
hex | 234232bb9771 |
38767225968497 has 16 divisors (see below), whose sum is σ = 41937311539200. Its totient is φ = 35624002226112.
The previous prime is 38767225968491. The next prime is 38767225968509. The reversal of 38767225968497 is 79486952276783.
38767225968497 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is a cyclic number.
It is not a de Polignac number, because 38767225968497 - 26 = 38767225968433 is a prime.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (38767225968491) 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 15 ways as a sum of consecutive naturals, for example, 232268528 + ... + 232435374.
It is an arithmetic number, because the mean of its divisors is an integer number (2621081971200).
Almost surely, 238767225968497 is an apocalyptic number.
It is an amenable number.
38767225968497 is a deficient number, since it is larger than the sum of its proper divisors (3170085570703).
38767225968497 is a wasteful number, since it uses less digits than its factorization.
38767225968497 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 247232.
The product of its digits is 15362887680, while the sum is 83.
The spelling of 38767225968497 in words is "thirty-eight trillion, seven hundred sixty-seven billion, two hundred twenty-five million, nine hundred sixty-eight thousand, four hundred ninety-seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •