Base | Representation |
---|---|
bin | 10101111110011100001111… |
… | …000001000100010101001011 |
3 | 110200012122021210000100000101 |
4 | 111332130033001010111023 |
5 | 100132002444124000021 |
6 | 541320203534350231 |
7 | 26233503434401162 |
oct | 2576341701042513 |
9 | 420178253010011 |
10 | 96649901000011 |
11 | 28882aa1502a87 |
12 | aa0b49435b377 |
13 | 41c107b394168 |
14 | 19c1c472763d9 |
15 | b291444bda91 |
hex | 57e70f04454b |
96649901000011 has 4 divisors (see below), whose sum is σ = 96649941177400. Its totient is φ = 96649860822624.
The previous prime is 96649900999969. The next prime is 96649901000053. The reversal of 96649901000011 is 11000010994669.
It is a semiprime because it is the product of two primes.
It is an interprime number because it is at equal distance from previous prime (96649900999969) and next prime (96649901000053).
It is a cyclic number.
It is not a de Polignac number, because 96649901000011 - 211 = 96649900997963 is a prime.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (96649901000111) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (23) of ones.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 16233741 + ... + 21373678.
It is an arithmetic number, because the mean of its divisors is an integer number (24162485294350).
Almost surely, 296649901000011 is an apocalyptic number.
96649901000011 is a deficient number, since it is larger than the sum of its proper divisors (40177389).
96649901000011 is a wasteful number, since it uses less digits than its factorization.
96649901000011 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 40177388.
The product of its (nonzero) digits is 104976, while the sum is 46.
The spelling of 96649901000011 in words is "ninety-six trillion, six hundred forty-nine billion, nine hundred one million, eleven", and thus it is an aban number.
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.094 sec. • engine limits •