Base | Representation |
---|---|
bin | 11101011011001000000… |
… | …01010111010101101001 |
3 | 10120122120000012022100001 |
4 | 32231210001113111221 |
5 | 113031004310101042 |
6 | 2052240031543001 |
7 | 133020260026006 |
oct | 16554401272551 |
9 | 3518500168301 |
10 | 1010995393897 |
11 | 35a8405a8095 |
12 | 143b3038aa61 |
13 | 7444b26c788 |
14 | 36d0a8788ad |
15 | 1b471be5bb7 |
hex | eb64057569 |
1010995393897 has 8 divisors (see below), whose sum is σ = 1026126050912. Its totient is φ = 995865948000.
The previous prime is 1010995393829. The next prime is 1010995393907. The reversal of 1010995393897 is 7983935990101.
1010995393897 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is a sphenic number, since it is the product of 3 distinct primes.
It is a cyclic number.
It is not a de Polignac number, because 1010995393897 - 211 = 1010995391849 is a prime.
It is a super-2 number, since 2×10109953938972 (a number of 25 digits) contains 22 as substring.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (1010995390897) by changing a digit.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 1455022 + ... + 2034472.
It is an arithmetic number, because the mean of its divisors is an integer number (128265756364).
Almost surely, 21010995393897 is an apocalyptic number.
It is an amenable number.
1010995393897 is a deficient number, since it is larger than the sum of its proper divisors (15130657015).
1010995393897 is an equidigital number, since it uses as much as digits as its factorization.
1010995393897 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 605559.
The product of its (nonzero) digits is 16533720, while the sum is 64.
The spelling of 1010995393897 in words is "one trillion, ten billion, nine hundred ninety-five million, three hundred ninety-three thousand, eight hundred ninety-seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.067 sec. • engine limits •