Base | Representation |
---|---|
bin | 10000000000010101111… |
… | …111110111001010010111 |
3 | 10220010222120120012121222 |
4 | 100000111333313022113 |
5 | 121010023424042302 |
6 | 2201140032200555 |
7 | 142315032416636 |
oct | 20002577671227 |
9 | 3803876505558 |
10 | 1099880690327 |
11 | 394502a80961 |
12 | 1591b799915b |
13 | 7c945163633 |
14 | 3b33d6cb51d |
15 | 1d925284da2 |
hex | 10015ff7297 |
1099880690327 has 2 divisors, whose sum is σ = 1099880690328. Its totient is φ = 1099880690326.
The previous prime is 1099880690309. The next prime is 1099880690387. The reversal of 1099880690327 is 7230960889901.
It is a weak prime.
It is a cyclic number.
It is not a de Polignac number, because 1099880690327 - 226 = 1099813581463 is a prime.
It is a self number, because there is not a number n which added to its sum of digits gives 1099880690327.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (1099880690387) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 549940345163 + 549940345164.
It is an arithmetic number, because the mean of its divisors is an integer number (549940345164).
Almost surely, 21099880690327 is an apocalyptic number.
1099880690327 is a deficient number, since it is larger than the sum of its proper divisors (1).
1099880690327 is an equidigital number, since it uses as much as digits as its factorization.
1099880690327 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 11757312, while the sum is 62.
The spelling of 1099880690327 in words is "one trillion, ninety-nine billion, eight hundred eighty million, six hundred ninety thousand, three hundred twenty-seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.080 sec. • engine limits •