Base | Representation |
---|---|
bin | 1001000001010001100101… |
… | …00011110101111101001001 |
3 | 2121020012121202110100110212 |
4 | 10200220302203311331021 |
5 | 10044434043322323034 |
6 | 110104024310250505 |
7 | 4115013653432144 |
oct | 440506243657511 |
9 | 77205552410425 |
10 | 19835007229769 |
11 | 6357a85535796 |
12 | 22841a7956a35 |
13 | b0b58284a204 |
14 | 4c803b60905b |
15 | 245e49e1e2ce |
hex | 120a328f5f49 |
19835007229769 has 2 divisors, whose sum is σ = 19835007229770. Its totient is φ = 19835007229768.
The previous prime is 19835007229733. The next prime is 19835007229783. The reversal of 19835007229769 is 96792270053891.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 17580309780544 + 2254697449225 = 4192888^2 + 1501565^2 .
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-19835007229769 is a prime.
It is a super-2 number, since 2×198350072297692 (a number of 27 digits) contains 22 as substring.
It is a junction number, because it is equal to n+sod(n) for n = 19835007229699 and 19835007229708.
It is not a weakly prime, because it can be changed into another prime (19835007222769) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 9917503614884 + 9917503614885.
It is an arithmetic number, because the mean of its divisors is an integer number (9917503614885).
Almost surely, 219835007229769 is an apocalyptic number.
It is an amenable number.
19835007229769 is a deficient number, since it is larger than the sum of its proper divisors (1).
19835007229769 is an equidigital number, since it uses as much as digits as its factorization.
19835007229769 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 102876480, while the sum is 68.
The spelling of 19835007229769 in words is "nineteen trillion, eight hundred thirty-five billion, seven million, two hundred twenty-nine thousand, seven hundred sixty-nine".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •