Base | Representation |
---|---|
bin | 100011110111000011… |
… | …110000110010100111 |
3 | 10200101110101021101212 |
4 | 203313003300302213 |
5 | 1112324200300444 |
6 | 25404441142035 |
7 | 2532116344556 |
oct | 436703606247 |
9 | 120343337355 |
10 | 38504696999 |
11 | 1536999683a |
12 | 756718a91b |
13 | 38283461a2 |
14 | 1c13b6bd9d |
15 | 10055b919e |
hex | 8f70f0ca7 |
38504696999 has 2 divisors, whose sum is σ = 38504697000. Its totient is φ = 38504696998.
The previous prime is 38504696939. The next prime is 38504697059. The reversal of 38504696999 is 99969640583.
It is a balanced prime because it is at equal distance from previous prime (38504696939) and next prime (38504697059).
It is a cyclic number.
It is not a de Polignac number, because 38504696999 - 28 = 38504696743 is a prime.
It is a super-2 number, since 2×385046969992 (a number of 22 digits) contains 22 as substring.
It is a Sophie Germain prime.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (38504696939) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 19252348499 + 19252348500.
It is an arithmetic number, because the mean of its divisors is an integer number (19252348500).
Almost surely, 238504696999 is an apocalyptic number.
38504696999 is a deficient number, since it is larger than the sum of its proper divisors (1).
38504696999 is an equidigital number, since it uses as much as digits as its factorization.
38504696999 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 113374080, while the sum is 68.
The spelling of 38504696999 in words is "thirty-eight billion, five hundred four million, six hundred ninety-six thousand, nine hundred ninety-nine".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.074 sec. • engine limits •