Base | Representation |
---|---|
bin | 1001110100101011110101… |
… | …0011010110100010110001 |
3 | 1102020112120000020020212001 |
4 | 2131022331103112202301 |
5 | 2403424340234432131 |
6 | 34545441201534001 |
7 | 2163220001042662 |
oct | 235127523264261 |
9 | 42215500206761 |
10 | 10800723749041 |
11 | 3494619a89116 |
12 | 1265304644301 |
13 | 60467203ac65 |
14 | 294a87651369 |
15 | 13ae41a49261 |
hex | 9d2bd4d68b1 |
10800723749041 has 8 divisors (see below), whose sum is σ = 10805600170304. Its totient is φ = 10795848214320.
The previous prime is 10800723749033. The next prime is 10800723749047. The reversal of 10800723749041 is 14094732700801.
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 10800723749041 - 23 = 10800723749033 is a prime.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 10800723748982 and 10800723749000.
It is not an unprimeable number, because it can be changed into a prime (10800723749047) 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 7 ways as a sum of consecutive naturals, for example, 24783166 + ... + 25215208.
It is an arithmetic number, because the mean of its divisors is an integer number (1350700021288).
Almost surely, 210800723749041 is an apocalyptic number.
It is an amenable number.
10800723749041 is a deficient number, since it is larger than the sum of its proper divisors (4876421263).
10800723749041 is an equidigital number, since it uses as much as digits as its factorization.
10800723749041 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 443271.
The product of its (nonzero) digits is 338688, while the sum is 46.
The spelling of 10800723749041 in words is "ten trillion, eight hundred billion, seven hundred twenty-three million, seven hundred forty-nine thousand, forty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •