Base | Representation |
---|---|
bin | 10001011101101000000101… |
… | …11111011001000101010011 |
3 | 12000222010121022010011010111 |
4 | 20232310002333121011103 |
5 | 20013131432302001104 |
6 | 213401200553542151 |
7 | 11042256214544143 |
oct | 1056640277310523 |
9 | 160863538104114 |
10 | 38401352765779 |
11 | 11265a16573633 |
12 | 4382533414957 |
13 | 18573029c2963 |
14 | 96a8c7726923 |
15 | 468d9229c404 |
hex | 22ed02fd9153 |
38401352765779 has 2 divisors, whose sum is σ = 38401352765780. Its totient is φ = 38401352765778.
The previous prime is 38401352765759. The next prime is 38401352765821. The reversal of 38401352765779 is 97756725310483.
38401352765779 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is a weak prime.
It is a cyclic number.
It is not a de Polignac number, because 38401352765779 - 25 = 38401352765747 is a prime.
It is not a weakly prime, because it can be changed into another prime (38401352765719) 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, 19200676382889 + 19200676382890.
It is an arithmetic number, because the mean of its divisors is an integer number (19200676382890).
It is a 1-persistent number, because it is pandigital, but 2⋅38401352765779 = 76802705531558 is not.
Almost surely, 238401352765779 is an apocalyptic number.
38401352765779 is a deficient number, since it is larger than the sum of its proper divisors (1).
38401352765779 is an equidigital number, since it uses as much as digits as its factorization.
38401352765779 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 266716800, while the sum is 67.
The spelling of 38401352765779 in words is "thirty-eight trillion, four hundred one billion, three hundred fifty-two million, seven hundred sixty-five thousand, seven hundred seventy-nine".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •