Base | Representation |
---|---|
bin | 10110101011110000110001… |
… | …110010100000101000001001 |
3 | 111002020101012002022110112012 |
4 | 112223300301302200220021 |
5 | 101034014324413112123 |
6 | 552103034134225305 |
7 | 30004510145346056 |
oct | 2653606162405011 |
9 | 432211162273465 |
10 | 99764335675913 |
11 | 298738a9702477 |
12 | b232bb61b5235 |
13 | 43889760a532c |
14 | 1a8c8962d602d |
15 | b801752e3378 |
hex | 5abc31ca0a09 |
99764335675913 has 4 divisors (see below), whose sum is σ = 100399777304580. Its totient is φ = 99128894047248.
The previous prime is 99764335675867. The next prime is 99764335675957. The reversal of 99764335675913 is 31957653346799.
It is a semiprime because it is the product of two primes.
It can be written as a sum of positive squares in 2 ways, for example, as 23384216932729 + 76380118743184 = 4835723^2 + 8739572^2 .
It is a cyclic number.
It is not a de Polignac number, because 99764335675913 - 240 = 98664824048137 is a prime.
It is a Duffinian number.
It is a Curzon number.
It is not an unprimeable number, because it can be changed into a prime (99764335675993) by changing a digit.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 317720814098 + ... + 317720814411.
It is an arithmetic number, because the mean of its divisors is an integer number (25099944326145).
Almost surely, 299764335675913 is an apocalyptic number.
It is an amenable number.
99764335675913 is a deficient number, since it is larger than the sum of its proper divisors (635441628667).
99764335675913 is a wasteful number, since it uses less digits than its factorization.
99764335675913 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 635441628666.
The product of its digits is 3472081200, while the sum is 77.
The spelling of 99764335675913 in words is "ninety-nine trillion, seven hundred sixty-four billion, three hundred thirty-five million, six hundred seventy-five thousand, nine hundred thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •