Base | Representation |
---|---|
bin | 11110100000001001000… |
… | …110111001111110100011 |
3 | 21102101101121000102010120 |
4 | 132200021012321332203 |
5 | 233320301243030411 |
6 | 4242533353531323 |
7 | 304303143134040 |
oct | 36401106717643 |
9 | 7371347012116 |
10 | 2096096845731 |
11 | 738a4a02a359 |
12 | 29a2a2713b43 |
13 | 122879530275 |
14 | 736473aa1c7 |
15 | 397ce722106 |
hex | 1e8091b9fa3 |
2096096845731 has 8 divisors (see below), whose sum is σ = 3194052336384. Its totient is φ = 1197769626120.
The previous prime is 2096096845727. The next prime is 2096096845757. The reversal of 2096096845731 is 1375486906902.
It is a sphenic number, since it is the product of 3 distinct primes.
It is not a de Polignac number, because 2096096845731 - 22 = 2096096845727 is a prime.
It is a super-2 number, since 2×20960968457312 (a number of 25 digits) contains 22 as substring.
It is not an unprimeable number, because it can be changed into a prime (2096096846731) 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, 49907067735 + ... + 49907067776.
It is an arithmetic number, because the mean of its divisors is an integer number (399256542048).
It is a 1-persistent number, because it is pandigital, but 2⋅2096096845731 = 4192193691462 is not.
Almost surely, 22096096845731 is an apocalyptic number.
2096096845731 is a gapful number since it is divisible by the number (21) formed by its first and last digit.
2096096845731 is a deficient number, since it is larger than the sum of its proper divisors (1097955490653).
2096096845731 is an equidigital number, since it uses as much as digits as its factorization.
2096096845731 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 99814135521.
The product of its (nonzero) digits is 19595520, while the sum is 60.
The spelling of 2096096845731 in words is "two trillion, ninety-six billion, ninety-six million, eight hundred forty-five thousand, seven hundred thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.065 sec. • engine limits •