Base | Representation |
---|---|
bin | 1001110111001001101001… |
… | …0101001001011111001001 |
3 | 1102101120220100120122022120 |
4 | 2131302122111021133021 |
5 | 2410123120143041444 |
6 | 35021124550441453 |
7 | 2166246540102132 |
oct | 235623225113711 |
9 | 42346810518276 |
10 | 10843086690249 |
11 | 3500588837930 |
12 | 1271567963289 |
13 | 608663802288 |
14 | 296b45992c89 |
15 | 13c0c0bd6b19 |
hex | 9dc9a5497c9 |
10843086690249 has 64 divisors (see below), whose sum is σ = 16952129141760. Its totient is φ = 6095588152320.
The previous prime is 10843086690223. The next prime is 10843086690253. The reversal of 10843086690249 is 94209668034801.
It is not a de Polignac number, because 10843086690249 - 28 = 10843086689993 is a prime.
It is a Curzon number.
It is a junction number, because it is equal to n+sod(n) for n = 10843086690192 and 10843086690201.
It is not an unprimeable number, because it can be changed into a prime (10843086690349) 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 63 ways as a sum of consecutive naturals, for example, 5406034 + ... + 7135220.
It is an arithmetic number, because the mean of its divisors is an integer number (264877017840).
Almost surely, 210843086690249 is an apocalyptic number.
10843086690249 is a gapful number since it is divisible by the number (19) formed by its first and last digit.
It is an amenable number.
10843086690249 is a deficient number, since it is larger than the sum of its proper divisors (6109042451511).
10843086690249 is a wasteful number, since it uses less digits than its factorization.
10843086690249 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1729430.
The product of its (nonzero) digits is 17915904, while the sum is 60.
The spelling of 10843086690249 in words is "ten trillion, eight hundred forty-three billion, eighty-six million, six hundred ninety thousand, two hundred forty-nine".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.074 sec. • engine limits •